Optimal estimation for chaotic sequences using the Viterbi algorithm
Optimal estimation for chaotic sequences using the Viterbi algorithm
复制标题
使用维特比算法对混沌序列进行最优估计
DOI：
10.1109/acssc.2001.987662
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
D. Williams
中科院分区：
文献类型：
--
作者：
M. Ciftci;D. Williams
许多基于混沌的通信算法已经被提出。然而，这些算法的性能受到噪声的限制。本文提出了一种新的、计算效率高的混沌序列最优估计算法。首先，利用混沌系统的符号动力学表示，使混沌动力学的表示由一个等价的格子图。然后，利用维特比算法对混沌序列进行降噪处理。该算法产生最小均方误差估计。该算法的性能方面的改善与信号噪声比（SNR）的模拟流行的混沌映射，包括混沌映射，帐篷，和Logistic映射。该算法也被纳入混沌通信系统，并产生的误码率（BER）性能。
Many communications algorithms based on chaos have been proposed previously. However, the performance of these proposed algorithms has been limited by noise. In this paper, a novel, computationally efficient, optimal estimation algorithm for chaotic sequences is presented. First, a symbolic dynamics representation of the chaotic system is exploited to enable the representation of the chaotic dynamics by an equivalent trellis diagram. Then, the Viterbi algorithm is used to reduce the noise from the corrupted chaotic sequence. This algorithm yields the minimum mean square error estimate. The performance of the algorithm in terms of improvement versus signal-to-noise ratio (SNR) is simulated for popular chaotic maps, including sawtooth, tent, and logistic maps. The algorithm is also incorporated into a chaotic communication system, and the resulting bit-error rate (BER) performance is presented.