Generating 2k pseudo-random sequences using quasi-chaotic mealy limited state machine

Zhang Shenru; Wang Tingchang; Deng Xiaoyan

Volume 25 Issue 5

May 2003

Turn off MathJax

Article Contents

Article Navigation > Journal of Electronics & Information Technology > 2003 > 25(5): 664-670

Zhang Shenru, Wang Tingchang, Deng Xiaoyan. Generating 2k pseudo-random sequences using quasi-chaotic mealy limited state machine[J]. Journal of Electronics & Information Technology, 2003, 25(5): 664-670.

Citation:

Zhang Shenru, Wang Tingchang, Deng Xiaoyan. Generating 2k pseudo-random sequences using quasi-chaotic mealy limited state machine[J]. Journal of Electronics & Information Technology, 2003, 25(5): 664-670.

Citation:

PDF( 533 KB)

Generating 2k pseudo-random sequences using quasi-chaotic mealy limited state machine

Received Date: 2001-11-30
Rev Recd Date: 2002-05-20
Publish Date: 2003-05-19

Abstract

Abstract

In this paper a method of generating 2k pseudo-random sequences to obtain stable long period of m-sequences and high complexity of chaotic sequences is discussed. A quasi-chaotic function acts as Mealy limited state machine and m-sequence acts as its input. The periodic nature of sequences is analyzed and the randomness of sequences is tested. The simulation results in chip of FPGA for frequency hopping code generator are reported.

FullText(HTML)

References(1)

References

D.R. Frey, Chaotic digital encoding: An approach to secure communication, IEEE Trans. on CAS., 1993, CAS-40(10), 660-666.[2]M. Itoh, Chai Wan Wu, L. O. Chua, Communication system via chaotic signal from a reconstruction viewpoint, International Journal of Bifurcation and Chaos, 1997, 7(2), 275-286.[3]周红,罗杰,凌燮亭,混沌非线性反馈密码序列的理论设计和有限精度实现,电子学报,1997,25(10),57-60.[4]王育民,何大可,保密学-基础与应用,西安,西安电子科技大学出版社,1990,6.4,7.2,7.3节.[5]A.D.弗莱德曼,著,刘春和,译,数字系统逻辑设计,北京,人民邮电出版社,1982,5.1节.[6]周红,俞军,凌燮亭,混沌前馈型流密码的设计,电子学报,1998,26(1),98-101.[7]张申如,梅文华,王庭昌,邓晓燕,非周期q元随机序列的游程特性,通信学报,2000,21(1),45-48.

Relative Articles

Supplements(0)

Cited By

Proportional views