DocumentCode
1222790
Title
Analysis on Stability of Binary Chaotic Pseudorandom Sequence
Author
Xiang, Fei ; Qiu, Shui-Sheng
Author_Institution
Sch. of Electron. & Inf. Eng., South China Univ. of Technol., Guangzhou
Volume
12
Issue
5
fYear
2008
fDate
5/1/2008 12:00:00 AM
Firstpage
337
Lastpage
339
Abstract
This paper presents the definition of k-error approximate entropy and proves its two basic properties, which measures the stability of chaotic pseudorandom sequences. Then the stabilities of Logistic, Henon, Tent and Chebyshev maps are evaluated. Simulation results indicate that the approach is effective, which can distinguish the difference of stability of diverse chaotic sequences, and is an effective means for evaluating the stability of chaotic sequences.
Keywords
binary sequences; chaotic communication; computational complexity; entropy; random sequences; stability; Chebyshev maps; Henon maps; Logistic maps; Tent maps; binary chaotic pseudorandom sequence; k-error approximate entropy; k-error linear complexity; stability analysis; Chaos; Chaotic communication; Chebyshev approximation; Communication system security; Entropy; Logistics; Performance evaluation; Random sequences; Stability analysis; Testing;
fLanguage
English
Journal_Title
Communications Letters, IEEE
Publisher
ieee
ISSN
1089-7798
Type
jour
DOI
10.1109/LCOMM.2008.080133
Filename
4524232
Link To Document