On Computing the Discrete Cosine Transform

Authors:
B. D. Tseng;W. C. Miller
Affiliations:
Department of Electrical Engineering, University of Windsor;-
Venue:
IEEE Transactions on Computers
Year:
1978

Citing 3
Cited 7

Numerical Analysis: A fast fourier transform algorithm for real-valued series

Communications of the ACM
Discrete Cosine Transfom

IEEE Transactions on Computers
A Storage Efficient Way to Implement the Discrete Cosine Transform

IEEE Transactions on Computers

JAGUAR: a high speed VLSI chip for JPEG image compression standard

VLSID '95 Proceedings of the 8th International Conference on VLSI Design
Reversible integer-to-integer mapping of N-point orthonormal block transforms

Signal Processing
A New Algorithm for Discrete Cosine Transform of Arbitrary Number of Points

IEEE Transactions on Computers
A Symmetric Cosine Transform

IEEE Transactions on Computers
Type-II/III DCT/DST algorithms with reduced number of arithmetic operations

Signal Processing
Interesting properties of the discrete cosine transform

Journal of Visual Communication and Image Representation
Image compression algorithm based on morphological associative memories

CIARP'06 Proceedings of the 11th Iberoamerican conference on Progress in Pattern Recognition, Image Analysis and Applications

Quantified Score

Hi-index	14.99

Visualization

Abstract

Haralick has shown that the discrete cosine transform of N points can be computed more rapidly by taking two N-point fast Fourier transforms (FFT's) than by taking one 2N-point FFT as Ahmed had proposed. In this correspondence, we show that if Haralick had made use of the fact that the FFT's of real sequences can be computed more rapidly than general FFT's, the result would have been reversed. A modified algorithm is also presented.