DocumentCode
588950
Title
Research on the First Class M Subsequence
Author
Yingni Duan ; Haifeng Zhang ; Hong Lv ; Junchu Fang
Author_Institution
Dept. of MEE, Xi´an Univ. of Arts & Sci., Xi´an, China
fYear
2012
fDate
17-18 Nov. 2012
Firstpage
503
Lastpage
506
Abstract
For the difficulty of pseudo-random sequence generation, on the basis of construction research of the first class m subsequence, this paper realizes m subsequence based on shift register theory and deduces feedback function expression of m subsequence and analyses linear complexity of sequence by applying B-M algorithm. The analysis shows that linear complexity of m subsequence is larger than linear complexity of m sequence, close to a half of m sequence period.
Keywords
computational complexity; feedback; m-sequences; matrix algebra; random number generation; random sequences; B-M algorithm; feedback function expression; first class m subsequence; linear complexity analysis; pseudorandom sequence generation; shift register theory; Algorithm design and analysis; Complexity theory; Educational institutions; Polynomials; Random sequences; Shift registers; B-M algorithm; linear complexity; m subsequence; pseudo-random sequence; shift register theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Intelligence and Security (CIS), 2012 Eighth International Conference on
Conference_Location
Guangzhou
Print_ISBN
978-1-4673-4725-9
Type
conf
DOI
10.1109/CIS.2012.119
Filename
6406070
Link To Document