LDPC codes for compression of multi-terminal sources with hidden Markov correlation

摘要

We propose the use of low-density parity-check (LDPC) codes for compression of memory correlated binary sources. The correlation model between the sources is defined by a hidden Markov model. The resulting performance is close to the theoretical Slepian-Wolf (1973) limit. No information about the sources statistics is required in the encoding process.