Comparison of performance between chaotic sequences and nonlinear sequences based on shift register

Mi Liang; Zhu Zhongliang

Volume 25 Issue 11

Nov. 2003

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2003 > 25(11): 1475-1481

Mi Liang, Zhu Zhongliang. Comparison of performance between chaotic sequences and nonlinear sequences based on shift register[J]. Journal of Electronics & Information Technology, 2003, 25(11): 1475-1481.

Citation:

Mi Liang, Zhu Zhongliang. Comparison of performance between chaotic sequences and nonlinear sequences based on shift register[J]. Journal of Electronics & Information Technology, 2003, 25(11): 1475-1481.

Citation:

PDF( 1311 KB)

Comparison of performance between chaotic sequences and nonlinear sequences based on shift register

Received Date: 2002-06-24
Rev Recd Date: 2002-10-29
Publish Date: 2003-11-19

Abstract

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.

FullText(HTML)

References(1)

References

G. Heidari-Bateni, C. D. McGillem, A chaotic direct-sequence spread-spectrum communication system, IEEE Trans. on Commun., 1994, COM-42(2/3/4), 1524-1527.[2]G. Mazzini, G. Setti, R. Rovatti, Chaotic complex spreading sequences for asynchronous DSCDMA-Part Ⅰ: System modeling and results, IEEE Trans. on Circuits and Syst., 1997, CAS-I,44(10), 937-947.[3]R. Rovatti, G. Setti, G. Mazzini, Chaotic complex spreading sequences for asynchronous DSCDMA-Part Ⅱ: Some theoretical performance bounds, IEEE Trans. on Circuits and Syst., 1998,CAS-I, 45(4), 496-506.[4]Ling Cong,Li Shaoqian,Chaotic spreading sequences with multiple access performance better than random sequences,IEEE Trans.on Circuits and Syst.,2000,CAS-I,47(3),394-397.[5]凌聪,孙松庚,混沌扩频序列发生器,电子科学学刊,1998,20(2),235-240.[6]K.Kelber,M.Gotz,W.Schwarz,Generation of signals with n-dimensional nniform probabilitv distribution by digital filter structures,Proc.ofthe 7thIEEE Digital Signal Processing Workshop (DSPWS96),Loen,Norway,September 2-4,1996,486-489.[7]荆涛,徐勇,杨怀江,宋建中,一种基于神经网络的混沌序列产生方法,通信学报,1999,20(6),77-81.[8]Ren Yong, Xia Yongxiang, Shan Xiuming, Yuan Jian, Driving synchronization of spatiotemporal chaos and its application in CDMA communications, International Journal of Bifurcation and Chaos, 2001, 11(12), 3117-3124.[9]E.J. Groth, Generation of binary sequences with controllable complexity, IEEE Trans. on Info.Theory, 1971, IT-17(3), 288-296.[10]K.H. Karkkainen, Comparison of performance between AND and majority logic type nonlinear feedforward logic pseudonoise sequence generators, IEICE Trans. on Fundamentals, 1999, E82-A(8), 1641-1647.[11]杨义先,林须端,编码密码学,北京,人民邮电出版社,1992,第十五章、第十六章.[12]E.L. Key, An analysis of the structure and complexity of nonlinear binary sequence generator,IEEE Trans. on Info. Theory, 1976, IT-22(6), 732-736.[13]M. B. Pursley, Performance evaluation for phase-coded spread-spectrum multiple-access communication-Part Ⅰ: System analysis, IEEE Trans. on Commun., 1977, COM-25(8), 795-799.[14]K.H. Karkkainen.[J].P. A. Leppanen, Comparison of the performance of some linear spreading code families for asynchronous DS/SSMA systems, MILCOM91, Mclean, Virginia, USA, November 4-.1991,:-

Relative Articles

Supplements(0)

Cited By

Proportional views