Asymptotic performance of multiple description transform codes
نویسندگان
چکیده
The multiple description transform coder is introduced for sources with memory and an asymptotic analysis is presented for the squared error distortion. For stationary Gaussian sources, the optimal transform and the optimal bit allocation for the multiple description coder are identical to those for the single description coder.
منابع مشابه
Low-complexity transform coding with integer-to-integer transforms
In this paper we propose the application of a new transform-based coding method[1] in conjunction with Golomb-Rice ( ) codes to lower significantly the complexity, which can be used in various applications, e.g. the Multiple Description coding[2]. The theoretical evaluations predict no important loss in compression performance, while the complexity is considerably reduced. Since codes are very ...
متن کاملCentral Decoding for Multiple Description Codes based on Domain Partitioning
Multiple Description Codes (MDC) can be used to trade redundancy against packet loss resistance for transmitting data over lossy diversity networks. In this work we focus on MD transform coding based on domain partitioning. Compared to Vaishampayan’s quantizer based MDC, domain based MD coding is a simple approach for generating different descriptions, by using different quantizers for each des...
متن کاملLinear codes with complementary duals related to the complement of the Higman-Sims graph
In this paper we study codes $C_p(overline{{rm HiS}})$ where $p =3,7, 11$ defined by the 3- 7- and 11-modular representations of the simple sporadic group ${rm HS}$ of Higman and Sims of degree 100. With exception of $p=11$ the codes are those defined by the row span of the adjacency matrix of the complement of the Higman-Sims graph over $GF(3)$ and $GF(7).$ We show that these codes ha...
متن کاملHybrid numerical–asymptotic code for dispersive- pulse propagation calculations
A fast, hybrid numerical–asymptotic algorithm for the calculation of the dynamical field evolution that is due to an arbitrary input pulse in any linear dispersive, attenuative medium is presented. The algorithm combines the numerical efficiency of the fast-Fourier-transform algorithm over a finite frequency domain that encompasses all the medium resonances with the accuracy and analytical effi...
متن کاملA general construction of Reed-Solomon codes based on generalized discrete Fourier transform
In this paper, we employ the concept of the Generalized Discrete Fourier Transform, which in turn relies on the Hasse derivative of polynomials, to give a general construction of Reed-Solomon codes over Galois fields of characteristic not necessarily co-prime with the length of the code. The constructed linear codes enjoy nice algebraic properties just as the classic one.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 43 شماره
صفحات -
تاریخ انتشار 1997