2008
DOI: 10.1109/icassp.2008.4518272
|View full text |Cite
|
Sign up to set email alerts
|

Rate-adaptive codes for the entire Slepian-Wolf region and arbitrarily correlated sources

Abstract: In this paper, we focus on the design of distributed source codes that can achieve any point in the Slepian-Wolf (SW) region and at the same time adapt to any correlation between the sources. A practical solution based on punctured accumulated LDPC codes extended to the non asymmetric case is described. The approach allows flexible rate allocation to the two sources with a gap of 0.0677 bits with respect to the minimum achievable rate.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
25
0

Year Published

2008
2008
2014
2014

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(25 citation statements)
references
References 18 publications
0
25
0
Order By: Relevance
“…Puncturing the syndrome bits may degrade the performance of the code. The approach considered in [34], similarly to [36] for the asymmetric setup, consists of first protecting the syndromes with an accumulator code. The effect of the accumulator code followed by the puncturing is equivalent to merging some rows of the parity-check matrix H by adding them, thus constructing a matrix H i of dimension (n Ϫ k i ) ϫ n, of rank n Ϫ k i .…”
Section: Rate Adaptationmentioning
confidence: 99%
“…Puncturing the syndrome bits may degrade the performance of the code. The approach considered in [34], similarly to [36] for the asymmetric setup, consists of first protecting the syndromes with an accumulator code. The effect of the accumulator code followed by the puncturing is equivalent to merging some rows of the parity-check matrix H by adding them, thus constructing a matrix H i of dimension (n Ϫ k i ) ϫ n, of rank n Ϫ k i .…”
Section: Rate Adaptationmentioning
confidence: 99%
“…Likewise, s ′ m is built upons m ands m . Again we should emphasize that using R ′ m = S ′ m S ′H m (andR ′ m ) may not necessarily improve the error localization; to expect gain by virtue of the extended subspace method, we need to compensate for the termHc in (18). This is done for the syndrome-based DSC in the next section.…”
Section: Now Withmentioning
confidence: 99%
“…Rate-adaption using puncturing is not natural for syndromebased DSC systems [18]. Instead, the encoder can transmit a short syndrome based on an aggressive code and augment it with additional syndrome samples, if decoding fails.…”
Section: B Syndrome-based Approachmentioning
confidence: 99%
“…For instance, Pradhan and Ramchandran 8 proposed a method to implement nonasymmetric DSC based on the DISCUS algorithm. Zarasoa et al 13 proposed a nonsymmetric DSC scheme based on syndrome LDPC. At the decoder side, the two received sources were decoded by making use of the mutual information that is directly transmitted.…”
Section: Introductionmentioning
confidence: 99%