Generate bit error patterns
out = randerr(m)
out = randerr(m,n)
out = randerr(m,n,errors)
out = randerr(m,n,prob,state)
out = randerr(m,n,prob,s)
For all syntaxes, randerr
treats each row
of out
independently.
out = randerr(m)
generates
an m
-by-m
binary matrix, each
row of which has exactly one nonzero entry in a random position. Each
allowable configuration has an equal probability.
out = randerr(m,n)
generates
an m
-by-n
binary matrix, each
row of which has exactly one nonzero entry in a random position. Each
allowable configuration has an equal probability.
out = randerr(m,n,errors)
generates
an m
-by-n
binary matrix, where errors
determines
how many nonzero entries are in each row:
If errors
is a scalar, it is the
number of nonzero entries in each row.
If errors
is a row vector, it lists
the possible number of nonzero entries in each row.
If errors
is a matrix having two
rows, the first row lists the possible number of nonzero entries in
each row and the second row lists the probabilities that correspond
to the possible error counts.
Once randerr
determines the number of
nonzero entries in a given row, each configuration of that number
of nonzero entries has equal probability.
out = randerr(m,n,prob,state)
is
the same as the syntax above, except that it first resets the state
of the uniform random number generator rand
to
the integer state
.
Note:
This usage is deprecated and may be removed in a future release.
Instead of |
This function uses, by default, the Mersenne Twister algorithm by Nishimura and Matsumoto.
Note:
Using the See |
out = randerr(m,n,prob,s)
causes
rand to use the random stream s. See RandStream for more details.