DocumentCode :
937288
Title :
A trellis code construction and coding theorem for stationary Gaussian sources (Corresp.)
Author :
Mazor, Baruch ; Pearlman, William A.
Volume :
29
Issue :
6
fYear :
1983
fDate :
11/1/1983 12:00:00 AM
Firstpage :
924
Lastpage :
930
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 :
Gaussian processes; Karhunen-Loeve transforms; Rate-distortion theory; Source coding; Trellis coding; Constraint theory; Convolutional codes; Decoding; Distortion measurement; Karhunen-Loeve transforms; Nonlinear distortion; Nonlinear filters; Rate-distortion; Source coding; Viterbi algorithm;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1983.1056750
Filename :
1056750
Link To Document :
بازگشت