|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| W.W., Jr. Warlick, J.E. Hershey, "High-Speed M-Sequence Generators," IEEE Transactions on Computers, vol. 29, no. 5, pp. 398-400, May, 1980. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1980.1675590, author = {W.W., Jr. Warlick and J.E. Hershey}, title = {High-Speed M-Sequence Generators}, journal ={IEEE Transactions on Computers}, volume = {29}, number = {5}, issn = {0018-9340}, year = {1980}, pages = {398-400}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1980.1675590}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - High-Speed M-Sequence Generators IS - 5 SN - 0018-9340 SP398 EP400 EPD - 398-400 A1 - W.W., Jr. Warlick, A1 - J.E. Hershey, PY - 1980 KW - primitive trinomials KW - Decimation KW - equipartition of linear recurrences KW - high-speed m-sequences KW - multiplexed polynomial sequences VL - 29 JA - IEEE Transactions on Computers ER - | |||
The generation of high-speed maximal length "M"-sequences is at the heart of many diverse techniques, notably code-division multiple access communications systems, or spectrum spreading, and precise ranging disciplines. This paper develops a rich family of M-sequences whose upper speed bound is set by the fastest shift register stage available in the technology under consideration and not by logic gate delays.
Index Terms:
primitive trinomials, Decimation, equipartition of linear recurrences, high-speed m-sequences, multiplexed polynomial sequences
Citation:
W.W., Jr. Warlick, J.E. Hershey, "High-Speed M-Sequence Generators," IEEE Transactions on Computers, vol. 29, no. 5, pp. 398-400, May 1980, doi:10.1109/TC.1980.1675590
Usage of this product signifies your acceptance of the Terms of Use.

