Joint source-channel coding using finite state integer arithmetic codes

Inserting redundancy to arithmetic codes is a common strategy to add error detection capability to this well-known family of source codes. By using this strategy error correction is possible through some decoding algorithms such as Viterbi decoder. In this paper a system has proposed that uses finite state integer arithmetic codes (FSAC) as a joint source-channel code in combination with a cyclic redundancy check (CRC) and a List Viterbi decoder. The proposed scheme has shown better performance than previous ones.

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

[2]  Carl-Erik W. Sundberg,et al.  List Viterbi decoding algorithms with applications , 1994, IEEE Trans. Commun..

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

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

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

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

[7]  Michel Kieffer,et al.  Asymptotic Error-Correcting Performance of Joint Source-Channel Schemes based on Arithmetic Coding , 2006, 2006 IEEE Workshop on Multimedia Signal Processing.

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

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