Combined Incremental and Decremental Redundancy in Joint Source-Channel Coding

In [1] a new lossless source coding scheme was presented. Thereby lossless compression is guaranteed by finely puncturing encoded data of a parallel concatenated turbo code while verifying the integrity of the source information at the source encoder. We extend this method to include transmission of the compressed data through a noisy channel and also ensure lossless recovery of the information at the receiver. Compression and error protection are achieved by adapting the puncturing strategy to the statistics of the source and the channel.

[1]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .

[2]  Ying Zhao,et al.  Compression of correlated binary sources using turbo codes , 2001, IEEE Communications Letters.

[3]  David Chase,et al.  Code Combining - A Maximum-Likelihood Decoding Approach for Combining an Arbitrary Number of Noisy Packets , 1985, IEEE Transactions on Communications.

[4]  Michelle Effros,et al.  Universal lossless source coding with the Burrows Wheeler transform , 1999, Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096).

[5]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[6]  Ying Zhao,et al.  Compression of binary memoryless sources using punctured turbo codes , 2002, IEEE Communications Letters.

[7]  Shlomo Shamai,et al.  A new data compression algorithm for sources with memory based on error correcting codes , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).

[8]  Joachim Hagenauer,et al.  LOSSLESS TURBO SOURCE CODING WITH DECREMENTAL REDUNDANCY , 2004 .

[9]  Shu Lin,et al.  Automatic-repeat-request error-control schemes , 1984, IEEE Communications Magazine.