|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
High Speed Generation of Maximal Length Sequences
February 1971 (vol. 20 no. 2)
pp. 227-229
| ASCII Text | x | ||
| A. Lempel, W.L. Eastman, "High Speed Generation of Maximal Length Sequences," IEEE Transactions on Computers, vol. 20, no. 2, pp. 227-229, February, 1971. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1971.223220, author = {A. Lempel and W.L. Eastman}, title = {High Speed Generation of Maximal Length Sequences}, journal ={IEEE Transactions on Computers}, volume = {20}, number = {2}, issn = {0018-9340}, year = {1971}, pages = {227-229}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1971.223220}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - High Speed Generation of Maximal Length Sequences IS - 2 SN - 0018-9340 SP227 EP229 EPD - 227-229 A1 - A. Lempel, A1 - W.L. Eastman, PY - 1971 KW - Feedback shift register KW - maximal-length sequences from linear shift registers KW - rate multiplication. VL - 20 JA - IEEE Transactions on Computers ER - | |||
The construction described in this note makes possible the generation of any given linear shift register sequence of maximal period p= 2n-1, at a rate k times faster than the shift pulse rate. The construction is valid for any positive integer k which is not a multiple of p and it employs at most k linear shift registers of degree n or less.
Index Terms:
Feedback shift register, maximal-length sequences from linear shift registers, rate multiplication.
Citation:
A. Lempel, W.L. Eastman, "High Speed Generation of Maximal Length Sequences," IEEE Transactions on Computers, vol. 20, no. 2, pp. 227-229, Feb. 1971, doi:10.1109/T-C.1971.223220
Usage of this product signifies your acceptance of the Terms of Use.