DocumentCode :
2765544
Title :
Analysis of complexity of PCM chaotic code in changeable order hyperchaotic circuit system
Author :
Zi, Kin ; Kuijun, Li ; Yong, Xu
Author_Institution :
Dept. of Commun. Eng., Changchun Post Inst. & Telecommun., China
Volume :
1
fYear :
2000
fDate :
2000
Firstpage :
272
Abstract :
This paper mainly analyzes the complexity of PCM chaotic code by means of the time sequence method on a changeable order hyperchaotic circuit system. Both the computer-based simulation results and the experimental circuit results are obtained. After comparing complexity of chaotic system with that of hyperchaotic system, we draw a conclusion that their theoretical results is in accordance with experimental one
Keywords :
binary sequences; chaos; chaos generators; circuit simulation; codes; computational complexity; pulse code modulation; PCM chaotic code complexity; binary time sequence; changeable order hyperchaotic circuit system; chaotic system complexity; computer-based simulation results; time sequence method; Chaos; Chaotic communication; Circuit noise; Communication system security; Phase change materials; Quantization; Signal processing; Switches; Switching circuits; Wideband;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Signal Processing Proceedings, 2000. WCCC-ICSP 2000. 5th International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-5747-7
Type :
conf
DOI :
10.1109/ICOSP.2000.894489
Filename :
894489
Link To Document :
بازگشت