作者
Mihai Bogdan Luca, Alexandru Serbanescu, Stéphane Azou, Gilles Burel
发表日期
2004/6/3
研讨会论文
IEEE Communications
简介
In this article, a new compression method is investigated using a particular chaotic modulation type. The symbolic approach presented associates to every informational sequence a trajectory in the state space of the chaotic generator. We are also introducing a new type of chaotic generator adapted to the probability distribution of the informational sequence, and we prove that using the described generator the theoretical compression performances attain the optimal entropy compression. Finally we confirm the theoretical analysis with performance tests for different sequences with different symbolic probabilities.
引用总数
2005200620072008200920102011201220132014201520162017201820192020202120222023122121173211
学术搜索中的文章