|
| This Article | ||
| | ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| K.S. Shanmugam, "Comments on "Discrete Cosine Transform"," IEEE Transactions on Computers, vol. 24, no. 7, pp. 759, July, 1975. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1975.224301, author = {K.S. Shanmugam}, title = {Comments on "Discrete Cosine Transform"}, journal ={IEEE Transactions on Computers}, volume = {24}, number = {7}, issn = {0018-9340}, year = {1975}, pages = {759}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1975.224301}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - Comments on "Discrete Cosine Transform" IS - 7 SN - 0018-9340 SP EP EPD - 759 A1 - K.S. Shanmugam, PY - 1975 KW - null VL - 24 JA - IEEE Transactions on Computers ER - | |||
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.
Citation:
K.S. Shanmugam, "Comments on "Discrete Cosine Transform"," IEEE Transactions on Computers, vol. 24, no. 7, pp. 759, July 1975, doi:10.1109/T-C.1975.224301
Usage of this product signifies your acceptance of the Terms of Use.