Code optimisation for lossless compression of binary memoryless sources based on FEC codes

A novel source coding scheme based on turbo codes was recently presented. Lossless data compression is thereby achieved by puncturing data encoded with a turbo code while checking the integrity of the reconstructed information during compression. This paper addresses the generalisation of this compression scheme to iteratively decodable forward error correcting (FEC) codes. Furthermore, an alternative puncturing algorithm is presented which fine-tunes the compression rate to any desired accuracy. Motivated by an area property which states that the area of the tunnel in the modified extrinsic information transfer (EXIT) chart is proportional to the gap between source coding rate and entropy we apply code optimisation tools to serially concatenated codes in order to minimise the tunnel. Numerical results show that compression rates close to the Shannon limit can be obtained by optimised irregular repeat accumulate codes.

[1]  J. Hagenauer,et al.  Combined Incremental and Decremental Redundancy in Joint Source-Channel Coding , 2004 .

[2]  S. Brink.  Rate one-half code for approaching the Shannon limit by 0.1 dB , 2000 .

[3]  Michael Mitzenmacher,et al.  A digital fountain approach to asynchronous reliable multicast , 2002, IEEE J. Sel. Areas Commun..

[4]  Stephan ten Brink,et al.  Extrinsic information transfer functions: model and erasure channel properties , 2004, IEEE Transactions on Information Theory.

[5]  A. Glavieux,et al.  Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

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

[7]  Joachim Hagenauer,et al.  The Turbo-Fountain and its Application to Reliable Wireless Broadcast , 2005 .

[8]  Giuseppe Caire.  Universal data compression with LDPC codes , 2003 .

[9]  Joachim Hagenauer,et al.  Joint Source-Channel-Fountain Coding for Asynchronous Broadcast , 2005 .

[10]  Michael Mitzenmacher,et al.  Digital fountains: a survey and look forward , 2004, Information Theory Workshop.

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

[12]  Giuseppe Caire,et al.  Almost noiseless joint source channel coding-decoding of sources of memory , 2004 .

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