Pseudorandom binary sequence
From Wikipedia, the free encyclopedia
A binary sequence (BS) is a sequence of N bits,
- aj for j = 0,1,...,N − 1,
i.e. m ones and N − m zeros. A BS is pseudo-random (PRBS) if its autocorrelation function:
has only two values:
where
is called the duty cycle of the PRBS.
A PRBS is random in a sense that the value of an aj element is independent of the values of any of the other elements, similar to real random sequences.
It is 'pseudo' because it is deterministic and after N elements it starts to repeat itself, unlike real random sequences, such as sequences generated by radioactive decay or by white noise. The PRBS is more general than the n-sequence, which is a special pseudo-random binary sequence of n bits generated as the output of a linear shift register. An n-sequence always has a 1/2 duty cycle and its number of elements N = 2k − 1. PRBS's are used in telecommunication, encryption, simulation, correlation technique and time-of-flight spectroscopy.
Contents |
[edit] Practical implementation
Pseudorandom binary sequences can be generated using linear feedback shift registers. [1]
[edit] References
- ^ Paul H. Bardell, William H. McAnney, and Jacob Savir, "Built-In Test for VLSI: Pseudorandom Techniques", John Wiley & Sons, New York, 1987.
[edit] See also
[edit] External links
 |
This article does not cite any references or sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. (January 2008) |
