Abstract：Both chaotic sequences and nonlinear feed-forward logic (NLFFL) sequences based on linear shift register almost have the same properties: the ease of their generation and various families with a large family size and long sequence period, as well as their broadband noise-like and non-linear nature. Their generation methods, correlation properties, Code Division Multi-ple Access (CDMA) properties and their resistance against correlation attack are compared in the paper. By simulation, it shows that most of their properties are comparable, but chaotic sequences are less vulnerable to correlation attack and jamming than some NLFFL sequences when their period is less than or equal to 1023, so they have more practical value than these nonlinear sequences based on shift register.
米良; 朱中梁. 混沌序列与一类基于移位寄存器的非线性序列的性能比较[J]. 电子与信息学报, 2003, 25(11): 1475-1481 .
Mi Liang; Zhu Zhongliang. Comparison of performance between chaotic sequences and nonlinear sequences based on shift register. , 2003, 25(11): 1475-1481 .
2003, Vol. 25 
