State machine interpretation of arithmetic codes for joint source and channel coding

Based on the encoding process, arithmetic codes can be viewed as tree codes and current proposals for decoding arithmetic codes with forbidden symbols belong to sequential decoding algorithms and their variants. However, arithmetic coding can also be modeled as a finite state machine and can be treated as a variable-length trellis code. The number of states used for decoding can be reduced and techniques used for convolutional codes such as the list Viterbi decoding algorithm can be applied on the trellis. The proposed approach provides a rich environment for the design of joint source/channel codes. The particular implementation presented here shows significant performance improvement over previous approaches.

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

[2]  G. Blelloch.  Introduction to Data Compression * , 2022 .

[3]  Khalid Sayood,et al.  Hard decision and iterative joint source channel coding using arithmetic codes , 2005, Data Compression Conference.

[4]  Yasuo Hirata,et al.  High-Rate Punctured Convolutional Codes for Soft Decision Viterbi Decoding , 1984, IEEE Trans. Commun..

[5]  David J. Miller,et al.  Improved joint source-channel decoding for variable-length encoded data using soft decisions and MMSE estimation , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

[6]  C. Guillemot,et al.  Joint source-channel decoding of quasiarithmetic codes , 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

[7]  Thomas Guionnet,et al.  Soft and Joint Source-Channel Decoding of Quasi-Arithmetic Codes , 2004, EURASIP J. Adv. Signal Process..

[8]  P. Cosman,et al.  MAP DECODING OF ARITHMETIC CODES WITH A FORBIDDEN SYMBOL , 2002 .

[9]  Jossy Sayir.  On coding by probability transformation , 1999 .

[10]  A. Hedayat,et al.  List-decoding of variable-length codes with application in joint source-channel coding , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[11]  Richard D. Wesel,et al.  Robust joint Huffman and convolutional decoding , 1999, Gateway to 21st Century Communications Village. VTC 1999-Fall. IEEE VTS 50th Vehicular Technology Conference (Cat. No.99CH36324).

[12]  Gabriella Olmo,et al.  Joint source-channel iterative decoding of codes , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

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

[14]  Joachim Hagenauer,et al.  Iterative source/channel-decoding using reversible variable length codes , 2000, Proceedings DCC 2000. Data Compression Conference.

[15]  Khalid Sayood,et al.  Joint source/channel coding using arithmetic codes , 2001, IEEE Trans. Commun..

[16]  Thomas E. Fuja,et al.  Robust transmission of variable-length encoded sources , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[17]  Khalid Sayood,et al.  Joint source/channel coding for variable length codes , 2000, IEEE Trans. Commun..

[18]  Khalid Sayood,et al.  Introduction to Data Compression, Third Edition (Morgan Kaufmann Series in Multimedia Information and Systems) , 2005 .

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

[20]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

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

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

[23]  Khalid Sayood,et al.  Joint source channel coding using arithmetic codes and trellis coded modulation , 2001, Proceedings DCC 2001. Data Compression Conference.

[24]  Joachim Hagenauer,et al.  On variable length codes for iterative source/channel decoding , 2001, Proceedings DCC 2001. Data Compression Conference.

[25]  Jeffrey Scott Vitter,et al.  Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding , 1994, Inf. Process. Manag..

[26]  David J. Miller,et al.  Joint source-channel decoding for variable-length encoded data by exact and approximate MAP sequence estimation , 2000, IEEE Trans. Commun..

[27]  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).

[28]  Jorma Rissanen,et al.  Compression of Black-White Images with Arithmetic Coding , 1981, IEEE Trans. Commun..

[29]  Khalid Sayood,et al.  Introduction to data compression (2nd ed.) , 2000 .

[30]  John D. Villasenor,et al.  Utilizing soft information in decoding of variable length codes , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

[31]  J. Vitter,et al.  Practical Implementations of Arithmetic Coding , 1991 .