Universal Slepian-Wolf source codes using low-density parity-check matrices

Matsuta, Tetsunao; Uyematsu, Tomohiko; Matsumoto, Ryutaroh

doi:10.1109/isit.2010.5513253

Cited by 4 publications

(9 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Binary LDPC codes have been used for SW coding in [3], [7], [20], [22], [30] and references therein. In all of the above cases, the LDPC decoder consists of a message passing procedure referred to as the sum-product algorithm.…”

Section: Related Workmentioning

confidence: 99%

“…LDPC codes initially introduced for channel coding can also be used for SW coding, after adaptation of the coding process and of the decoding algorithm [20], [22]. The SW coding of a source vector x of length n is performed by producing a vector s = H T x of length m < n. The matrix H is sparse, with coefficients in GF(q).…”

Section: Ldpc Encoding and Decodingmentioning

confidence: 99%

“…For this problem, it is well known that the infimum of achievable rates is given by H(X|Y ), the conditional entropy of X knowing Y and several practical coding schemes have been proposed [10], [24], [38]. Most of them are based on channel codes [9], [29], and particularly Low Density Parity Check (LDPC) codes [11], [20], [22]. In source coding, the source symbols are in general non-binary (for example the pixels or the quantized coefficients of the transformed blocks of an image).…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Density Evolution for the Design of Non-Binary Low Density Parity Check Codes for Slepian-Wolf Coding

Dupraz

Savin

Kieffer

2014

IEEE Trans. Commun.

View full text Add to dashboard Cite

International audienceIn this paper, we investigate the problem of designing good non-binary LDPC codes for Slepian-Wolf coding. The design method is based on Density Evolution which gives the asymptotic error probability of the decoder for given code degree distributions. Density Evolution was originally introduced for channel coding under the assumption that the channel is symmetric. In Slepian-Wolf coding, the correlation channel is not necessarily symmetric and the source distribution has to be taken into account. In this paper, we express the non-binary Density Evolution recursion for Slepian-Wolf coding. From Density Evolution, we then perform code degree distribution optimization using an optimization algorithm called differential evolution. Both asymptotic performance evaluation and finite-length simulations show the gain at considering optimized degree distributions for SW coding

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Ldpc Encoding and Decodingmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Density Evolution for the Design of Non-Binary Low Density Parity Check Codes for Slepian-Wolf Coding

Dupraz

Savin

Kieffer

2014

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…We note that given encoders and a decoder are universal in the sense that they can encode and decode (asymptotically) correctly even if statistical parameters such as the delays and the PMF of DMSs are unknown. We used an analogous technique using a mixed source in [11] to prove the existence of a code. However, since we could not use Gallager's techniques to the mixed source in [11], we did not give an exponential bound in it.…”

Section: Introductionmentioning

confidence: 99%

“…We used an analogous technique using a mixed source in [11] to prove the existence of a code. However, since we could not use Gallager's techniques to the mixed source in [11], we did not give an exponential bound in it. We also give an extension of our coding scheme: If possible delays are bounded, our coding scheme can be extended to a scheme which does not require knowledge of the actual bound of delays.…”

Section: Introductionmentioning

confidence: 99%

Coding Theorems for Asynchronous Slepian–Wolf Coding Systems

Matsuta

Uyematsu

2020

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

The Slepian-Wolf (SW) coding system is a source coding system with two encoders and a decoder, where these encoders independently encode source sequences from two correlated sources into codewords, and the decoder reconstructs both source sequences from the codewords. In this paper, we consider the situation in which the SW coding system is asynchronous, i.e., each encoder samples a source sequence with some unknown delay. We assume that delays are unknown but maximum and minimum values of possible delays are known to encoders and the decoder. We also assume that sources are discrete stationary memoryless and the probability mass function (PMF) of the sources is unknown but the system knows that it belongs to a certain set of PMFs. For this asynchronous SW coding system, we clarify the achievable rate region which is the set of rate pairs of encoders such that the decoding error probability vanishes as the blocklength tends to infinity. We show 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.

show abstract

Low-delay distributed source coding for time-varying sources with unknown statistics

Chen

Köksal

2015

2015 IEEE Conference on Computer Communications (INFOCOM)

View full text Add to dashboard Cite

Abstract-We consider a system in which two nodes take correlated measurements of a random source with time-varying and unknown statistics. The observations of the source at the first node are to be losslessly replicated with a given probability of outage at the second node, which receives data from the first node over a constant-rate errorless channel. We develop a system and associated strategies for joint distributed source coding (encoding and decoding) and transmission control in order to achieve low end-to-end delay. Slepian-Wolf coding in its traditional form cannot be applied in our scenario, since the encoder requires the joint statistics of the observations and the associated decoding delay is very high. We analytically evaluate the performance of our strategies and show that the delay achieved by them are order optimal, as the conditional entropy of the source approaches to the channel rate. We also evaluate the performance of our algorithms based on real-world experiments using two cameras recording videos of a scene at different angles. Having realized our schemes, we demonstrated that, even with a very low-complexity quantizer, a compression ratio of approximately 50% is achievable for lossless replication at the decoder, at an average delay of a few seconds.

show abstract

Universal Slepian-Wolf source codes using low-density parity-check matrices

Cited by 4 publications

References 10 publications

Density Evolution for the Design of Non-Binary Low Density Parity Check Codes for Slepian-Wolf Coding

Density Evolution for the Design of Non-Binary Low Density Parity Check Codes for Slepian-Wolf Coding

Coding Theorems for Asynchronous Slepian–Wolf Coding Systems

Low-delay distributed source coding for time-varying sources with unknown statistics

Contact Info

Product

Resources

About