Showing papers on "Modified discrete cosine transform published in 1984"
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.
661 citations
TL;DR: Fast decimation-in-time algorithms for the various discrete cosine transforms and discrete sine transforms are systematically developed, based on a radix-2 factorization of the transformation matrix, and indicate these to be attractive alternatives to existing algorithms in terms of computational complexity and structural simplicity.
Abstract: Fast decimation-in-time (DIT) algorithms for the various discrete cosine transforms (DCT) and discrete sine transforms (DST) are systematically developed, based on a radix-2 factorization of the transformation matrix. The results indicate these to be attractive alternatives to existing algorithms in terms of computational complexity and structural simplicity.
64 citations
TL;DR: If the original signal is defined to be symmetrical, the discrete Fourier transform used in cepstral analysis can be replaced by a discrete cosine transform (DCT) and it is found that the use of the DCT does not degrade the information contained in the cepstrum while substantially reducing the computational complexity.
Abstract: If the original signal is defined to be symmetrical, the discrete Fourier transform (DFT) used in cepstral analysis can be replaced by a discrete cosine transform (DCT). This principle is applied to the evaluation of the real and complex pseudocepstrum of speech signals. In both the real and complex cepstrum cases, it is found that the use of the DCT does not degrade the information contained in the cepstrum while substantially reducing the computational complexity.
18 citations
TL;DR: In this article, the performance of version I of the discrete cosine transform (DCT-I) is compared to version II of the DCT-II on various criteria.
Abstract: The performance of version I of the discrete cosine transform(DCT-I) is compared to version II of the discrete cosine transform (DCT-II) on various criteria. The results show that for a Markovian signal with correlation coefficient less than 0.8, the DCT-I performs as well as the DCT-II.
12 citations
01 Mar 1984
TL;DR: A new discrete cosine transform algorithm, named Fast Cosine Transform (FCT), is introduced, which reduces the number of multiplications to about half of earlier results, and renders a simple and systematic structure for implementation.
Abstract: A new discrete cosine transform algorithm, named Fast Cosine Transform (FCT), is introduced for the 2m-point discrete cosine transform This algorithm reduces the number of multiplications to about half of earlier results, and furthermore, it renders a simple and systematic structure for implementation
5 citations
Proceedings Article•
01 Jan 1984
2 citations
01 Jan 1984
1 citations
01 Mar 1984
TL;DR: The 2D forward and inverse discrete cosine transforms (DCT) are mapped by polynomial transforms into several one-dimensional DFTs, which is more attractive for computing the "inverse" 2D DCT.
Abstract: The 2D forward and inverse discrete cosine transforms (DCT) are mapped by polynomial transforms into several one-dimensional DFTs; This algorithm is more attractive for computing the "inverse" 2D DCT, it nicely eliminates N2premultiplications for the forward algorithm, and requires only N reduced real DFTs of size 2N; This inverse 2D DCT algorithm is 3 times faster than the forward one, more importantly it requires much less computation complexity than the most efficient recent algorithms.