DocumentCode
925314
Title
A limit on optimum performance degradation in fixed-rate coding of the discrete Fourier transform (Corresp.)
Author
Pearlman, William A.
Volume
22
Issue
4
fYear
1976
fDate
7/1/1976 12:00:00 AM
Firstpage
485
Lastpage
488
Abstract
The discrete Fourier transform (DFT) often is used instead of the optimum Karhunen-Lo
ve transform (KLT) in encoding a stationary normal time series, because the recursive FFT is computationally efficient and yields "nearly" uncorrelated components. Substituting the DFT for the KLT and then treating its components as if they were uncorrelated reduces the ultimate performance attainable in fixed-rate source coding. We address the problem of this performance degradation by deriving a simple and easily applied upper bound on the increase in the distortion-rate function (DRF) for the mean-squared error criterion incurred by substitution of the DFT for the KLT.
ve transform (KLT) in encoding a stationary normal time series, because the recursive FFT is computationally efficient and yields "nearly" uncorrelated components. Substituting the DFT for the KLT and then treating its components as if they were uncorrelated reduces the ultimate performance attainable in fixed-rate source coding. We address the problem of this performance degradation by deriving a simple and easily applied upper bound on the increase in the distortion-rate function (DRF) for the mean-squared error criterion incurred by substitution of the DFT for the KLT.Keywords
DFT; Discrete Fourier transforms (DFT´s); Karhunen-Loeve transforms; Rate-distortion theory; Transform coding; Covariance matrix; Degradation; Discrete Fourier transforms; H infinity control; Holographic optical components; Karhunen-Loeve transforms; Rate distortion theory; Rate-distortion; Source coding; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1976.1055569
Filename
1055569
Link To Document