Rate-adaptive distributed source coding using low-density parity-check codes

David Varodayan, Anne Aaron, Bernd Girod

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Source coding with correlated decoder side information is considered. We impose the practical constraint that the encoder be unaware of even the statistical dependencies between source and side information. Two classes of rate-adaptive distributed source codes, both based on Low-Density Parity-Check (LDPC) codes, are developed and their design is studied. Specific realizations are shown to be better than alternatives of linear encoding and decoding complexity. The proposed rate-adaptive LDPC Accumulate (LDPCA) codes and Sum LDPC Accumulate (SLDPCA) codes (of length 6336 bits) perform within 10% and 5% of the Slepian-Wolf bound in the moderate and high rate regimes, respectively.

Original languageEnglish (US)
Title of host publicationConference Record of The Thirty-Ninth Asilomar Conference on Signals, Systems and Computers
Pages1203-1207
Number of pages5
StatePublished - 2005
Externally publishedYes
Event39th Asilomar Conference on Signals, Systems and Computers - Pacific Grove, CA, United States
Duration: Oct 28 2005Nov 1 2005

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
Volume2005
ISSN (Print)1058-6393

Other

Other39th Asilomar Conference on Signals, Systems and Computers
Country/TerritoryUnited States
CityPacific Grove, CA
Period10/28/0511/1/05

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'Rate-adaptive distributed source coding using low-density parity-check codes'. Together they form a unique fingerprint.

Cite this