|
|
An efficient chaotic source coding scheme with variable-length blocks |
Lin Qiu-Zhen(林秋镇)a)†, Wong Kwok-Wo(黄国和)a), and Chen Jian-Yong(陈剑勇)b) |
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 |
|
|
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.
|
Received: 24 November 2010
Revised: 27 January 2011
Accepted manuscript online:
|
PACS:
|
05.45.-a
|
(Nonlinear dynamics and chaos)
|
|
05.45.Gg
|
(Control of chaos, applications of chaos)
|
|
05.45.Vx
|
(Communication using chaos)
|
|
Cite this article:
Lin Qiu-Zhen(林秋镇), Wong Kwok-Wo(黄国和), and Chen Jian-Yong(陈剑勇) An efficient chaotic source coding scheme with variable-length blocks 2011 Chin. Phys. B 20 070501
|
[1] |
Hayes S, Grebogi C and Ott E 1993 Phys. Rev. Lett. 70 3031
|
[2] |
Escribano F J, Kozic S, López L, Sanju'an M A F and Hasler M 2009 IEEE Trans. Commun. 57 597
|
[3] |
Li H J and Zhang J S 2010 Chin. Phys. B 19 050508
|
[4] |
Wong K W and Yuen C H 2008 IEEE Trans. Circuits Syst. II, Exp. Briefs 55 1193
|
[5] |
Wang F L 2010 Chin. Phys. B 19 090505
|
[6] |
Liu S B, Sun J, Xu Z Q and Liu J S 2009 Chin. Phys. B 18 5219
|
[7] |
Luca M B, Serbanescu A, Azou S and Burel G 2004 it IEEE-Communications Bucharest, Romania, June 3—5, 2004
|
[8] |
Nagaraj N, Vaidya P G and Bhat K G 2009 Commun. Nonlinear Sci. Numer. Simulat. 14 1013
|
[9] |
Witten I H, Neal R M and Cleary J G 1987 Commun. ACM. bf 30 520
|
[10] |
Chan D Y and Ku C Y 2005 Appl. Math. Comput. 167 976
|
[11] |
Chan D Y, Yang J F and Chen S Y 2001 IEEE Trans. Circuits Syst. Video Technol. 11 581
|
[12] |
Hardy Y and Sabatta D 2007 Phys. Lett. A 366 575
|
[13] |
Wong K W, Lin Q Z and Chen J Y 2010 IEEE Trans. Circuits Syst. II, Exp. Briefs 57 146
|
[14] |
Files are available at: ftp://ftp.cpsc.ucalgary.ca/pub/-projects/text.compression.corpus
|
[15] |
Said A 2004 Hewlett-Packard Laboratories Report, HPL-2004-76, Palo Alto, CA. Available at: http://www.-hpl.-hp.-com/techreports/2004/HPL-2004-76.pdf.
|
No Suggested Reading articles found! |
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
Altmetric
|
blogs
Facebook pages
Wikipedia page
Google+ users
|
Online attention
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
View more on Altmetrics
|
|
|