Compression of binary sources with side information using low-density parity-check codes

It is shown how low-density parity-check (LDPC) codes can be used as an application of the Slepian-Wolf (1973) theorem for correlated binary sources. We focus on the asymmetric case of compression with side information. The approach is based on viewing the correlation as a channel and applying the syndrome concept. The encoding and decoding procedures, i.e. the compression and decompression, are explained in detail. The simulated performance results are better than most of the existing turbo code results available in the literature and very close to the Slepian-Wolf limit.