This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected Shift Registers
February 1974 (vol. 23 no. 2)
pp. 146-152
W.J. Hurd, Communications Systems Research Section, Jet Propulsion Laboratory, California Institute of Technology
Some new algorithms are presented for efficiently generating pseudorandom noise both in hardware and software. In software, a new word of pseudorandom bits can be generated about every 12 machine cycles, and hardware implementations can generate pseudo Gaussian noise with bandwith of 20 MHz or more. The algorithms generate binary maximal-length linear recursive sequencies of high degree and with many nonzero terms. The ability to efficiently implement high-degree recursions is important because the number of consecutive bits which can be guaranteed to be both linearly and statistically independent is equal to the degree of the recursion. The implementations are by interconnection of several short shift registers in a linear manner in such a way that different widely spaced phase shifts of the same p-n sequence appear in the stages of the several registers. Some specific algorithms have been subjected to extensive statistical evaluation, with no evidence found to distinguish the sequences from purely random binary sequences.
Index Terms:
Chi-squared tests, Gaussian noise, linear finite state machines, linear recursive sequences, noise generation, primitive polynomials, pseudonoise, random numbers, shift register sequences, statistical tests.
Citation:
W.J. Hurd, "Efficient Generation of Statistically Good Pseudonoise by Linearly Interconnected Shift Registers," IEEE Transactions on Computers, vol. 23, no. 2, pp. 146-152, Feb. 1974, doi:10.1109/T-C.1974.223877
Usage of this product signifies your acceptance of the Terms of Use.