Chase-Like Decoding of Arithmetic Codes with Image Transmission Applications

Several recent contributions have demonstrated that Joint Source/ Channel (JSC) decoding could be a powerful technique to make error correction in the case of transmission of entropy encoded streams. This paper addresses a new scheme for JSC decoding of Arithmetic Codes (AC) based on Maximum A Posteriori (MAP) sequence estimation. The proposed algorithm performs Chase-like decoding using a priori knowledge of the source symbol sequence and the compressed bit stream lengths. Simulation results show that the proposed decoding algorithm leads to significant performance gain in comparison with classical arithmetic decoding, while exhibiting very low complexity. The practical relevance of the proposed technique is validated in the case of image transmission across the AWGN channel. Lossless and lossy image compression schemes were considered, and the Chase-like arithmetic decoder shows excellent results.

[1]  Kannan Ramchandran,et al.  Arithmetic coding based continuous error detection for efficient ARQ-based image transmission , 1997, Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136).

[2]  Khalid Sayood,et al.  State machine interpretation of arithmetic codes for joint source and channel coding , 2006, Data Compression Conference (DCC'06).

[3]  G. Olmo,et al.  Joint source/channel coding and MAP decoding of arithmetic codes , 2005, IEEE Transactions on Communications.

[4]  Thomas Guionnet,et al.  Soft decoding and synchronization of arithmetic codes: application to image transmission over noisy channels , 2003, IEEE Trans. Image Process..

[5]  M. Kieffer,et al.  Analytical tools for optimizing the error correction performance of arithmetic codes , 2008, IEEE Transactions on Communications.

[6]  Nick G. Kingsbury,et al.  The EREC: an error-resilient technique for coding variable-length blocks of data , 1996, IEEE Trans. Image Process..

[7]  Gabriella Olmo,et al.  Iterative Decoding of Serially Concatenated Arithmetic and Channel Codes With JPEG 2000 Applications , 2007, IEEE Transactions on Image Processing.

[8]  William A. Pearlman,et al.  A new, fast, and efficient image codec based on set partitioning in hierarchical trees , 1996, IEEE Trans. Circuits Syst. Video Technol..

[9]  Glen G. Langdon,et al.  Arithmetic Coding , 1979 .

[10]  Ammar Bouallègue,et al.  Low-Complexity Joint Source/Channel Turbo Decoding of Arithmetic Codes with Image Transmission Application , 2009, 2009 Data Compression Conference.

[11]  Kannan Ramchandran,et al.  Continuous error detection (CED) for reliable communication , 2001, IEEE Trans. Commun..

[12]  Yun Q. Shi,et al.  MAP symbol decoding of arithmetic coding with embedded channel coding , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[13]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[14]  Jossy Sayir.  Arithmetic coding for noisy channels , 1999, Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253).

[15]  David Chase,et al.  Class of algorithms for decoding block codes with channel measurement information , 1972, IEEE Trans. Inf. Theory.

[16]  John G. Cleary,et al.  Integrating error detection into arithmetic coding , 1997, IEEE Trans. Commun..

[17]  Khalid Sayood,et al.  Joint Source Channel Coding Using Arithmetic Codes , 2009, Joint Source Channel Coding Using Arithmetic Codes.