By Topic

Analysis on Stability of Binary Chaotic Pseudorandom Sequence

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fei Xiang ; Sch. of Electron. & Inf. Eng., South China Univ. of Technol., Guangzhou ; Shui-Sheng Qiu

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.

Published in:

Communications Letters, IEEE  (Volume:12 ,  Issue: 5 )