Compression of binary sources with side information at the decoder using LDPC codes Academic Article

abstract

• We show how low-density parity-check (LDPC) codes can be used to compress close to the Slepian-Wolf limit for correlated binary sources. Focusing on the asymmetric case of compression of an equiprobable memoryless binary source with side information at the decoder, the approach is based on viewing the correlation as a channel and applying the syndrome concept. The encoding and decoding procedures are explained in detail. The performance achieved is seen to be better than recently published results using turbo codes and very close to the Slepian-Wolf limit.

authors

• Georghiades, Costas
• Xiong, Zixiang

published proceedings

• IEEE COMMUNICATIONS LETTERS

altmetric score

• 3

author list (cited authors)

• Liveris, A. D., Xiong, Z. X., & Georghiades, C. N.

citation count

• 440

complete list of authors

• Liveris, AD||Xiong, ZX||Georghiades, CN

publication date

• October 2002

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Communications Letters  Journal

keywords

• Channel Coding
• Distributed Source Coding
• Ldpc Codes
• Slepian-wolf Theorem

Digital Object Identifier (DOI)

• 10.1109/LCOMM.2002.804244

start page

• 440

end page

• 442

volume

• 6

issue

• 10

URL

• http://dx.doi.org/10.1109/lcomm.2002.804244