A Storage Efficient Way to Implement the Discrete Cosine Transform

Authors:
R. M. Haralick
Affiliations:
Remote Sensing Laboratory, University of Kansas
Venue:
IEEE Transactions on Computers
Year:
1976

Citing 1
Cited 9

Discrete Cosine Transfom

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
A New Algorithm for Discrete Cosine Transform of Arbitrary Number of Points

IEEE Transactions on Computers
A Symmetric Cosine Transform

IEEE Transactions on Computers
Fast Algorithms for the 2-D Discrete Cosine Transform

IEEE Transactions on Computers
On Computing the Discrete 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
A fast video mixing method for multiparty video conference

ICIAR'05 Proceedings of the Second international conference on Image Analysis and Recognition
Memory-Efficiency and high-speed architectures for forward and inverse DCT with multiplierless operation

PSIVT'06 Proceedings of the First Pacific Rim conference on Advances in Image and Video Technology

Quantified Score

Hi-index	14.99

Visualization

Abstract

Ahmed has shown that a discrete cosine transform can be implemented by doing one double length fast Fourier transform (FFT). In this correspondence, we show that the amount of work can be cut to doing two single length FFT's.