2002
DOI: 10.1109/lcomm.2002.804244
|View full text |Cite
|
Sign up to set email alerts
|

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

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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

5
396
0
4

Year Published

2006
2006
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 546 publications
(405 citation statements)
references
References 12 publications
5
396
0
4
Order By: Relevance
“…The decoder must estimatex from s x , y, and the correlation factor p:x is the closest sequence to y with the syndrome s x . When the source has no memory and when the channel code is an LDPC code, this search can be efficiently performed with a modified Message-Passing (MP) [5].…”
Section: Estimation-decoding Em Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…The decoder must estimatex from s x , y, and the correlation factor p:x is the closest sequence to y with the syndrome s x . When the source has no memory and when the channel code is an LDPC code, this search can be efficiently performed with a modified Message-Passing (MP) [5].…”
Section: Estimation-decoding Em Algorithmmentioning
confidence: 99%
“…P θ (Xn = 0|σn, y, sx) = e Pn 1 + e Pn P θ (Xn = 1|σn, y, sx) = 1 − P θ (Xn = 0|σn, y, sx) (5) In this LDPC decoding, we have decided to propagate LLRs, which implies their conversion to probabilities in (5), for use at the maximization (3.2) and with the BCJR (3.3).…”
Section: Ldpc Decoding Sum-product Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…A Slepian-Wolf decoder reconstructs X from the Slepian-Wolf bitstream S(X) using Y as side information. Decoding is via LDPC belief propagation [9] initialized according to the statistics of the legitimate channel state at the worst permissible quality for the given original image. Finally, the image digest of X is computed and compared to the image digest, decrypted from the digital signature D(X, K s ) using a public key.…”
Section: Introductionmentioning
confidence: 99%
“…defined in the late seventies, the first constructive design of a DSC scheme using channel codes [3] has been formulated only recently. It has further motivated several researchers to build DSC solutions using different channel codes based on Turbo or LDPC codes [7]. Recently, distributed video encoders have been proposed using the Wyner-Ziv theorem [4]- [6], in an effort to reduce the complexity of the encoding process by shifting the motion estimation procedure to the decoder.…”
Section: Introductionmentioning
confidence: 99%