Rate-adaptive codes for distributed source coding

David Varodayan; Anne Aaron; Bernd Girod

doi:10.1016/j.sigpro.2006.03.012

Rate-adaptive codes for distributed source coding

David Varodayan
, Anne Aaron
, Bernd Girod

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	3123-3130
Number of pages	8
Journal	Signal Processing
Volume	86
Issue number	11
DOIs	https://doi.org/10.1016/j.sigpro.2006.03.012
State	Published - Nov 2006
Externally published	Yes

Keywords

Distributed source coding
Iterative decoding algorithms
LDPC codes
Side information
Slepian-Wolf theorem

ASJC Scopus subject areas

Control and Systems Engineering
Software
Signal Processing
Computer Vision and Pattern Recognition
Electrical and Electronic Engineering

Online availability

10.1016/j.sigpro.2006.03.012

Library availability

Discover UIUC Full Text

Cite this

@article{04b5c99d47274448af6dc92bff930361,

title = "Rate-adaptive codes for distributed source coding",

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

keywords = "Distributed source coding, Iterative decoding algorithms, LDPC codes, Side information, Slepian-Wolf theorem",

author = "David Varodayan and Anne Aaron and Bernd Girod",

note = "This work was supported by NSF under Grant No. CCR-0310376. It has been presented in part at the Asilomar Conference on Signals, Systems, and Computers 2005, in Pacific Grove, CA, USA.",

year = "2006",

month = nov,

doi = "10.1016/j.sigpro.2006.03.012",

language = "English (US)",

volume = "86",

pages = "3123--3130",

journal = "Signal Processing",

issn = "0165-1684",

publisher = "Elsevier B.V.",

number = "11",

}

TY - JOUR

T1 - Rate-adaptive codes for distributed source coding

AU - Varodayan, David

AU - Aaron, Anne

AU - Girod, Bernd

N1 - This work was supported by NSF under Grant No. CCR-0310376. It has been presented in part at the Asilomar Conference on Signals, Systems, and Computers 2005, in Pacific Grove, CA, USA.

PY - 2006/11

Y1 - 2006/11

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

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

KW - Distributed source coding

KW - Iterative decoding algorithms

KW - LDPC codes

KW - Side information

KW - Slepian-Wolf theorem

UR - https://www.scopus.com/pages/publications/33748328341

UR - https://www.scopus.com/pages/publications/33748328341#tab=citedBy

U2 - 10.1016/j.sigpro.2006.03.012

DO - 10.1016/j.sigpro.2006.03.012

M3 - Article

AN - SCOPUS:33748328341

SN - 0165-1684

VL - 86

SP - 3123

EP - 3130

JO - Signal Processing

JF - Signal Processing

IS - 11

ER -

Rate-adaptive codes for distributed source coding

Abstract

Keywords

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this