Compression with side information using turbo codes
2003pp. 252–261
Citations Over TimeTop 1% of 2003 papers
Abstract
We show that turbo codes can come close to the Slepian-Wolf bound in lossless distributed source coding. In the asymmetric scenario considered, X and Y are statistically dependent signals and X is encoded with no knowledge of Y. However, Y is known as side information at the decoder. We use a system based on turbo codes to send X at a rate close to H(X|Y). We apply our system to binary sequences and simulations show performance close to the information-theoretic limit. For distributed source coding of Gaussian sequences, our results show significant improvement over previous work. The scheme also performs well for joint source-channel coding.
Related Papers
- COMPARISON OF LOSSLESS DATA COMPRESSION ALGORITHMS FOR TEXT DATA(2010)
- → Study on the Real-Time Lossless Data Compression Method Used in the Readout System for Micropattern Gas Detector(2019)4 cited
- Efficiency of lossless data compression(2011)
- LOSSLESS DATA COMPRESSION TECHNIQUES AND COMPARISON BETWEEN THE ALGORITHMS(2015)
- Lossless Data Compression in Data Acquisition System(2003)