中国物理B ›› 2011, Vol. 20 ›› Issue (7): 70501-070501.doi: 10.1088/1674-1056/20/7/070501

• • 上一篇    下一篇

An efficient chaotic source coding scheme with variable-length blocks

陈剑勇1, 林秋镇2, 黄国和2   

  1. (1)Department of Computer Science and Technology, Shenzhen University, Shenzhen 518060, China; (2)Department of Electronic Engineering, City University of Hong Kong, Hong Kong 999077, China
  • 收稿日期:2010-11-24 修回日期:2011-01-27 出版日期:2011-07-15 发布日期:2011-07-15

An efficient chaotic source coding scheme with variable-length blocks

Lin Qiu-Zhen(林秋镇)a), Wong Kwok-Wo(黄国和)a), and Chen Jian-Yong(陈剑勇)b)   

  1. a Department of Electronic Engineering, City University of Hong Kong, Hong Kong 999077, China; b Department of Computer Science and Technology, Shenzhen University, Shenzhen 518060, China
  • Received:2010-11-24 Revised:2011-01-27 Online:2011-07-15 Published:2011-07-15

摘要: An efficient chaotic source coding scheme operating on variable-length blocks is proposed. With the source message represented by a trajectory in the state space of a chaotic system, data compression is achieved when the dynamical system is adapted to the probability distribution of the source symbols. For infinite-precision computation, the theoretical compression performance of this chaotic coding approach attains that of optimal entropy coding. In finite-precision implementation, it can be realized by encoding variable-length blocks using a piecewise linear chaotic map within the precision of register length. In the decoding process, the bit shift in the register can track the synchronization of the initial value and the corresponding block. Therefore, all the variable-length blocks are decoded correctly. Simulation results show that the proposed scheme performs well with high efficiency and minor compression loss when compared with traditional entropy coding.

关键词: chaos, compression, source coding, finite-precision implementation

Abstract: An efficient chaotic source coding scheme operating on variable-length blocks is proposed. With the source message represented by a trajectory in the state space of a chaotic system, data compression is achieved when the dynamical system is adapted to the probability distribution of the source symbols. For infinite-precision computation, the theoretical compression performance of this chaotic coding approach attains that of optimal entropy coding. In finite-precision implementation, it can be realized by encoding variable-length blocks using a piecewise linear chaotic map within the precision of register length. In the decoding process, the bit shift in the register can track the synchronization of the initial value and the corresponding block. Therefore, all the variable-length blocks are decoded correctly. Simulation results show that the proposed scheme performs well with high efficiency and minor compression loss when compared with traditional entropy coding.

Key words: chaos, compression, source coding, finite-precision implementation

中图分类号:  (Nonlinear dynamics and chaos)

  • 05.45.-a
05.45.Gg (Control of chaos, applications of chaos) 05.45.Vx (Communication using chaos)