Gaussian Multiple Description Coding with Low-Density Generator Matrix Codes
نویسندگان
چکیده
منابع مشابه
Predictive Multiple Description Coding Using Coset Codes
Multiple Description (MD) coding of predictively coded sources is of practical interest in several multimedia applications such as redundant storage of videolaudio data. and real-time videolaudio telephony. A key problem associated with predictive MD coding is the occurrence of predictive mismatch. In the present paper, we pose the problem of predictive MD coding as a variant of the Wyner-Ziv d...
متن کاملFrequency-eecient Coding with Low-density Generator Matrices
In a recent paper, it is shown that if Pearl's belief propagation algorithm is applied to the Bayesian belief network of a turbo code, the turbo decoding algorithm immediately results. From this perspective, it is recognized that the turbo coding structure imposes unnecessary diierentiation on the parity checks and the turbo decoding algorithm speciies a seemingly arbitrary sequential activatio...
متن کاملAsymmetric Multiple Description Coding using Layered Coding and Erasure Codes
With Asymmetric Multiple Description Coding we address the transmission case where there is a plethora of communication paths between sender and receiver, all with a different bandwidth and different levels of reliability (in terms of packet loss rate). For this scenario we have several possibilities for coding and transmission at our disposal, namely Round-Robin transmission, Layered Coding, T...
متن کاملTypical Performance of Irregular Low-Density Generator-Matrix Codes for Lossy Compression
We evaluate typical performance of irregular low-density generator-matrix (LDGM) codes, which is defined by sparse matrices with arbitrary irregular bit degree distribution and arbitrary check degree distribution, for lossy compression. We apply the replica method under one-step replica symmetry breaking (1RSB) ansatz to this problem. Typical performance of irregular LDGM codes for lossy compre...
متن کاملGaussian source coding with spherical codes
A fixed-rate shape–gain quantizer for the memoryless Gaussian source is proposed. The shape quantizer is constructed from wrapped spherical codes that map a sphere packing in 1 onto a sphere in , and the gain codebook is a globally optimal scalar quantizer. A wrapped Leech lattice shape quantizer is used to demonstrate a signal-to-quantization-noise ratio within 1 dB of the distortion-rate func...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2012
ISSN: 0090-6778
DOI: 10.1109/tcomm.2012.12.100562