LDPC code design for asynchronous Slepian-Wolf coding
TL;DR: This work considers asynchronous Slepian-Wolf coding where the two encoders may not have completely accurate timing information to synchronize their individual block code boundaries, and proposes LDPC code design in this scenario using a new information-theoretic coding scheme based on source splitting.
read more
Abstract: We consider asynchronous Slepian-Wolf coding where the two encoders may not have completely accurate timing information to synchronize their individual block code boundaries, and propose LDPC code design in this scenario. A new information-theoretic coding scheme based on source splitting is provided, which can achieve the entire asynchronous Slepian-Wolf rate region. Unlike existing methods based on source splitting, the proposed scheme does not require common randomness at the encoder and the decoder, or the construction of super-letter from several individual symbols. We then design LDPC codes based on this new scheme, by applying the recently discovered source-channel code correspondence. Experimental results validate the effectiveness of the proposed method.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Fig. 1. The achievable rate region for Slepian-Wolf coding. 
TABLE II OVERALL CODE PERFORMANCE OPERATING UNDER DIFFERENT dy FOR, p = 1/2, p = 1/3 AND p = 2/3, RESPECTIVELY. 
TABLE I PERFORMANCES OF DIFFERENT CODES UNDER VARIOUS dy WITH p = 0.5. 
Fig. 6. The performances of 6 irregular LDPC codes of length 2 × 105, with partial X side information at the decoder. 
Fig. 3. Illustration of the new scheme without common randomness. 
TABLE III RESULTS IN TERMS OF DISTANCE TO THE SLEPIAN-WOLF LIMIT.
Citations
On the Reliability Function of Variable-Rate Slepian-Wolf Coding
TL;DR: In this paper, the reliability function of variable-rate Slepian-Wolf codes with constant composition codes was analyzed and lower and upper bounds on the error rate were derived, and it was shown that variable rate codes can significantly outperform fixed rate codes in terms of rate-error tradeoff.
39
Coding Theorems for Asynchronous Slepian–Wolf Coding Systems
TL;DR: In this article, the authors consider the situation in which the Slepian-Wolf (SW) coding system is asynchronous, i.e., each encoder samples a source sequence with some unknown delay.
6
•Posted Content
Coding Theorems for Asynchronous Slepian-Wolf Coding Systems
TL;DR: The achievable rate region is clarified which is the set of rate pairs of encoders such that the decoding error probability vanishes as the blocklength tends to infinity and it is shown that this region does not always coincide with that of the synchronous SW coding system in which each encoder samples a source sequence without any delay.
4
Excess rate for model selection in interactive compression using belief propagation decoding
TL;DR: A new expression is proposed to evaluate the excess rate of mismatched decoding in a practical case of interest: when the decoder is the belief propagation algorithm and a good match is shown for practical interactive compression schemes based on fixed-length Low-Density Parity-Check (LDPC) codes.
Universal Decoding for Asynchronous Slepian-Wolf Encoding
TL;DR: In this paper, the authors considered the problem of source coding of two correlated memoryless sources using separate encoders and a joint decoder, and proposed a universal decoder that is asymptotically as good as the optimal maximum a posteriori probability (MAP) decoder in the sense of the random coding error exponent achieved.
2
References
•Book
Elements of information theory
Thomas M. Cover,Joy A. Thomas +1 more
- 01 Jan 1991
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Noiseless coding of correlated information sources
David Slepian,Jack K. Wolf +1 more
TL;DR: The minimum number of bits per character R_X and R_Y needed to encode these sequences so that they can be faithfully reproduced under a variety of assumptions regarding the encoders and decoders is determined.
•Book
Information Theory: Coding Theorems for Discrete Memoryless Systems
I. Csiszar,János Körner +1 more
- 26 Sep 2014
TL;DR: This new edition presents unique discussions of information theoretic secrecy and of zero-error information theory, including the deep connections of the latter with extremal combinatorics.
4.2K
Design of capacity-approaching irregular low-density parity-check codes
TL;DR: This work designs low-density parity-check codes that perform at rates extremely close to the Shannon capacity and proves a stability condition which implies an upper bound on the fraction of errors that a belief-propagation decoder can correct when applied to a code induced from a bipartite graph with a given degree distribution.
The capacity of low-density parity-check codes under message-passing decoding
TL;DR: The results are based on the observation that the concentration of the performance of the decoder around its average performance, as observed by Luby et al. in the case of a binary-symmetric channel and a binary message-passing algorithm, is a general phenomenon.