Compression of correlated binary sources using turbo codes
J Garcia-Frias - IEEE Communications letters, 2001 - ieeexplore.ieee.org
IEEE Communications letters, 2001•ieeexplore.ieee.org
We propose the use of punctured turbo codes for compression of correlated binary sources.
Compression is achieved because of puncturing. The resulting performance is close to the
theoretical limit provided by the Slepian-Wolf (1973) theorem. No information about the
correlation between sources is required in the encoding process. The proposed source
decoder utilizes iterative schemes, and performs well even when the correlation between
the sources is not known in the decoder, since it can be estimated jointly with the iterative …
Compression is achieved because of puncturing. The resulting performance is close to the
theoretical limit provided by the Slepian-Wolf (1973) theorem. No information about the
correlation between sources is required in the encoding process. The proposed source
decoder utilizes iterative schemes, and performs well even when the correlation between
the sources is not known in the decoder, since it can be estimated jointly with the iterative …
We propose the use of punctured turbo codes for compression of correlated binary sources. Compression is achieved because of puncturing. The resulting performance is close to the theoretical limit provided by the Slepian-Wolf (1973) theorem. No information about the correlation between sources is required in the encoding process. The proposed source decoder utilizes iterative schemes, and performs well even when the correlation between the sources is not known in the decoder, since it can be estimated jointly with the iterative decoding process.
ieeexplore.ieee.org