Showing papers on "Modified discrete cosine transform published in 1975"
TL;DR: The purpose of this note is to show that the DCT and the KLT are indeed asymptotically equivalent if the data covariance matrix is a Toeplitz matrix.
Abstract: In the above correspondence,1 Ahmed et al. proposed a discrete cosine transform (DCT) and compared its performance with the Karhunen-Loeve transform (KLT). They offered empirical evidence showing that the DCT and the KLT compare closely for a number of digital signal processing applications. The purpose of this note is to show that the DCT and the KLT are indeed asymptotically equivalent if the data covariance matrix is a Toeplitz matrix.
37 citations
TL;DR: In this article, a strategy for the numerical evaluation of Fourier sine and cosine transforms is presented, which is capable of high accuracy and incorporates error estimates which enable one to control the accuracy to which a computation is to be performed.
12 citations