Modified discrete cosine transform
About: Modified discrete cosine transform is a(n) research topic. Over the lifetime, 1453 publication(s) have been published within this topic receiving 30211 citation(s). The topic is also known as: Modified Discrete Cosine Transform, MDCT.
01 Jan 1974-IEEE Transactions on Computers
Abstract: A discrete cosine transform (DCT) is defined and an algorithm to compute it using the fast Fourier transform is developed. It is shown that the discrete cosine transform can be used in the area of digital processing for the purposes of pattern recognition and Wiener filtering. Its performance is compared with that of a class of orthogonal transforms and is found to compare closely to that of the Karhunen-Loeve transform, which is known to be optimal. The performances of the Karhunen-Loeve and discrete cosine transforms are also found to compare closely with respect to the rate-distortion criterion.
15 Aug 1990-
TL;DR: This paper presents two Dimensional DCT Algorithms and their relations to the Karhunen-Loeve Transform, and some applications of the DCT, which demonstrate the ability of these algorithms to solve the discrete cosine transform problem.
Abstract: Discrete Cosine Transform. Definitions and General Properties. DCT and Its Relations to the Karhunen-Loeve Transform. Fast Algorithms for DCT-II. Two Dimensional DCT Algorithms. Performance of the DCT. Applications of the DCT. Appendices. References. Index.
01 Sep 1977-IEEE Transactions on Communications
TL;DR: A Fast Discrete Cosine Transform algorithm has been developed which provides a factor of six improvement in computational complexity when compared to conventional DiscreteCosine Transform algorithms using the Fast Fourier Transform.
Abstract: A Fast Discrete Cosine Transform algorithm has been developed which provides a factor of six improvement in computational complexity when compared to conventional Discrete Cosine Transform algorithms using the Fast Fourier Transform. The algorithm is derived in the form of matrices and illustrated by a signal-flow graph, which may be readily translated to hardware or software implementations.
02 Sep 2011-arXiv: Information Theory
Abstract: The discrete cosine transform (DCT), introduced by Ahmed, Natarajan and Rao, has been used in many applications of digital signal processing, data compression and information hiding. There are four types of the discrete cosine transform. In simulating the discrete cosine transform, we propose a generalized discrete cosine transform with three parameters, and prove its orthogonality for some new cases. A new type of discrete cosine transform is proposed and its orthogonality is proved. Finally, we propose a generalized discrete W transform with three parameters, and prove its orthogonality for some new cases.
TL;DR: A new algorithm is introduced for the 2m-point discrete cosine transform that reduces the number of multiplications to about half of those required by the existing efficient algorithms, and it makes the system simpler.
Abstract: A new algorithm is introduced for the 2m-point discrete cosine transform. This algorithm reduces the number of multiplications to about half of those required by the existing efficient algorithms, and it makes the system simpler.