A Lower Bound on the Sum Rate of Multiple Description Coding With Symmetric Distortion Constraints

Song, Lin; Shao, Shuo

doi:10.1109/tit.2014.2360698

Cited by 17 publications

(18 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The introduction of (V 1 , V 2 ) is partly inspired by Ozarow's converse argument for the Gaussian multiple description problem [14] (see also [15]- [17]). …”

Section: Lower Boundmentioning

confidence: 99%

Broadcasting Correlated Vector Gaussians

Song

Tian

2015

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

The problem of sending two correlated vector Gaussian sources over a bandwidth-matched two-user scalar Gaussian broadcast channel is studied in this paper, where each receiver wishes to reconstruct its target source under a covariance distortion constraint. We derive a lower bound on the optimal tradeoff between the transmit power and the achievable reconstruction distortion pair. Our derivation is based on a new bounding technique which involves the introduction of appropriate remote sources. Furthermore, it is shown that this lower bound is achievable by a class of hybrid schemes for the special case, where the weak receiver wishes to reconstruct a scalar source under the mean squared error distortion constraint.

show abstract

“…The introduction of (V 1 , V 2 ) is partly inspired by Ozarow's converse argument for the Gaussian multiple description problem [14] (see also [15]- [17]). …”

Section: Lower Boundmentioning

confidence: 99%

Broadcasting Correlated Vector Gaussians

Song

Tian

2015

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

show abstract

“…Then if λ c,i −τ < 1/2r s/2 , the error in the reconstruction is at least 1/2r s/2 . If σ 2 X2−X1 = Θ(r 2 0 ) and r0 rc is constant as the limits in (22) are approached, the probability that Q s/2 (λ c,1 ) = Q s/2 (λ c,2 ) = τ and λ c,1 = λ c,2 does not approach 0, thus the central distortion cannot satisfy relation (29), while the proposed RDSC scheme can.…”

Section: Resultsmentioning

confidence: 99%

“…Notice that (M ν s ) 2 n = (M 2 Kν c ) 2 n . By plugging (28) in (24) and using the fact that K and κ 0 are constants, relation (29) follows. Further, equalities (23) and (29)…”

Section: Proof Of Corrollarymentioning

confidence: 99%

Lattice-Based Robust Distributed Source Coding

Elzouki

Dumitrescu

2019

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

In this paper, we propose a lattice-based robust distributed source coding system for two correlated sources and provide a detailed performance analysis under the high resolution assumption. It is shown, among other things, that, in the asymptotic regime where 1) the side distortion approaches 0 and 2) the ratio between the central and side distortions approaches 0, our scheme is capable of achieving the informationtheoretic limit of quadratic multiple description coding when the two sources are identical, whereas a variant of the random coding scheme by Chen and Berger with Gaussian codes has a performance loss of 0.5 bits relative to this limit.

show abstract

“…The desired conclusion that r ≥ r (k) (d k ) and that d j ≥ d (k) j (d k ) when r = r (k) (d k ) follows from the corresponding result for the quadratic Gaussian multiple description problem [26], [35]. Note that (k − 1)λ 2 X,2 (λ (k) S,1 )µ (k) (µ (k) − 1) + k(λ (k) X,1 ) 2 λ 2 S,2 = 0 (consequently, condition (11) is satisfied) when λ (j) S,1 > λ S,2 = 0.…”

Section: Proof Of Theoremmentioning

confidence: 90%

Robust Distributed Compression of Symmetrically Correlated Gaussian Sources

Wang

Xie

Zhang

2019

IEEE Trans. Commun.

Self Cite

View full text Add to dashboard Cite

Consider a lossy compression system with ℓ distributed encoders and a centralized decoder. Each encoder compresses its observed source and forwards the compressed data to the decoder for joint reconstruction of the target signals under the mean squared error distortion constraint. It is assumed that the observed sources can be expressed as the sum of the target signals and the corruptive noises, which are generated independently from two symmetric multivariate Gaussian distributions. Depending on the parameters of such distributions, the rate-distortion limit of this system is characterized either completely or at least for sufficiently low distortions. The results are further extended to the robust distributed compression setting, where the outputs of a subset of encoders may also be used to produce a non-trivial reconstruction of the corresponding target signals. In particular, we obtain in the high-resolution regime a precise characterization of the minimum achievable reconstruction distortion based on the outputs of k + 1 or more encoders when every k out of all ℓ encoders are operated collectively in the same mode that is greedy in the sense of minimizing the distortion incurred by the reconstruction of the corresponding k target signals with respect to the average rate of these k encoders.

show abstract

A Lower Bound on the Sum Rate of Multiple Description Coding With Symmetric Distortion Constraints

Cited by 17 publications

References 33 publications

Broadcasting Correlated Vector Gaussians

Broadcasting Correlated Vector Gaussians

Lattice-Based Robust Distributed Source Coding

Robust Distributed Compression of Symmetrically Correlated Gaussian Sources

Contact Info

Product

Resources

About