2015
DOI: 10.1134/s0005117915070073
|View full text |Cite
|
Sign up to set email alerts
|

A refined formula for the autocorrelation function of an M-sequence

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…The generating polynomial of the M-sequence is the primitive polynomial, and the longest possible period that a binary linear-feedback shift register sequence can generate is N = 2 n − 1, where n is the number of stages of the generating polynomial. The specific method of generation is not necessary to be clear; it is a sequence of 1s and 0s, which means that using the above method can transmit waveform modulation as well as decoding [64][65][66]. M-sequences are easy to generate, regular, and have many excellent properties, including the following:…”
Section: • M-sequencementioning
confidence: 99%
“…The generating polynomial of the M-sequence is the primitive polynomial, and the longest possible period that a binary linear-feedback shift register sequence can generate is N = 2 n − 1, where n is the number of stages of the generating polynomial. The specific method of generation is not necessary to be clear; it is a sequence of 1s and 0s, which means that using the above method can transmit waveform modulation as well as decoding [64][65][66]. M-sequences are easy to generate, regular, and have many excellent properties, including the following:…”
Section: • M-sequencementioning
confidence: 99%