摘要
主要阐述了如何利用时间序列分析法中的复杂度法对 PCM混沌编码的复杂度进行分析。在此基础上对随机系统、确定系统、混沌系统的复杂度进行了比较和讨论 。
Analysis of complexity of PCM chaotic code by using measure of complexity in time sequence analysis is presented. Then the comparison and discussion about the complexity of chaos and random systems and deterministic systems are conducted.Finally several important conclusions are given.
出处
《长春邮电学院学报》
2000年第2期13-16,共4页
Journal of Changchun Post and Telecommunication Institute
基金
信息产业部重点科技发展计划项目 !( 970 2 5
关键词
混沌
脉冲编码调制
复杂度
Chaos
Pulse code modulation
Measure of complexity
Lyapunov exponent
