A trellis code construction and coding theorem for stationary Gaussian sources (Corresp.)
- 1 November 1983
- journal article
- letter
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 29 (6) , 924-930
- https://doi.org/10.1109/tit.1983.1056750
Abstract
For stationary discrete-time Gaussian sources and the squared-error distortion measure, a trellis source code is constructed. The encoder consists of a Karhunen-Loeve transform on the source output followed by a search on a trellis structured code, where the decoder is a time-variant nonlinear filter. The corresponding code theorem is proved using the random coding argument. The proof technique follows that of Viterbi and Omura, who proved the trellis coding theorem for memoryless sources. The resultant coding scheme is implementable and applicable at any nonzero rate to a stationary Gaussian source with a bounded and continuous power spectrum. Therefore. for stationary sources, it is more general than Berger's tree coding scheme, which is restricted to autoregressive Gaussian sources in a region of high rate (low distortion).Keywords
This publication has 9 references indexed in Scilit:
- The Design of Trellis Waveform CodersIEEE Transactions on Communications, 1982
- Optimal encoding of discrete-time continuous-amplitude memoryless sources with finite output alphabetsIEEE Transactions on Information Theory, 1980
- A Fake Process Approach to Data CompressionIEEE Transactions on Communications, 1978
- Time-invariant trellis encoding of ergodic discrete-time sources with a fidelity criterionIEEE Transactions on Information Theory, 1977
- Tree coding of discrete-time abstract alphabet stationary block-ergodic sources with a fidelity criterionIEEE Transactions on Information Theory, 1976
- Tree encoding of speechIEEE Transactions on Information Theory, 1975
- Sliding-block source codingIEEE Transactions on Information Theory, 1975
- Trellis Encoding of memoryless discrete-time sources with a fidelity criterionIEEE Transactions on Information Theory, 1974
- Tree encoding of memoryless time-discrete sources with a fidelity criterionIEEE Transactions on Information Theory, 1969