Rate-adaptive codes for distributed source coding

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Signal processing Jg. 86; H. 11; S. 3123 - 3130
Hauptverfasser: Varodayan, David, Aaron, Anne, Girod, Bernd
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.11.2006
Schlagworte:
Distributed source coding
Iterative decoding algorithms
LDPC codes
Side information
Slepian–Wolf theorem
Iterative decoding algorithms
Side information
Slepian–Wolf theorem
LDPC codes
Distributed source coding
ISSN:0165-1684, 1872-7557
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0165-1684
1872-7557
DOI:10.1016/j.sigpro.2006.03.012