Fast DCT-I, DCT-III, and DCT-IV via moments

Authors:
J. G. Liu;Y. Z. Liu;G. Y. Wang
Affiliations:
Key Laboratory of Education Ministry for Image Processing and Intelligence Control, Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science & Technology, Wuha ...;Department of Computer Science and Engineering, China University of Geosciences, Wuhan, China;Key Laboratory of Education Ministry for Image Processing and Intelligence Control, Institute for Pattern Recognition and Artificial Intelligence, Huazhong University of Science & Technology, Wuha ...
Venue:
EURASIP Journal on Applied Signal Processing
Year:
2005

Citing 11
Cited 0

Efficient parallel algorithms for the computation of two-dimensional image moments

Pattern Recognition
Two-dimensional discrete cosine transform with linear systolic arrays

Systolic array processors
An all adder systolic structure for fast computation of moments

Journal of VLSI Signal Processing Systems
Fast Discrete Cosine Transform via Computation of Moments

Journal of VLSI Signal Processing Systems
A novel approach to fast discrete Fourier transform

Journal of Parallel and Distributed Computing
A new approach to fast calculation of moments of 3-D gray level images

Parallel Computing
DCT Implementation with Distributed Arithmetic

IEEE Transactions on Computers
Fundamentals of Digital Optics: Digital Signal Processing in Optics and Holography

Fundamentals of Digital Optics: Digital Signal Processing in Optics and Holography
A variable-radix digit-serial design methodology and its application to the discrete cosine transform

IEEE Transactions on Very Large Scale Integration (VLSI) Systems - Special section on system-level interconnect prediction (SLIP)
An efficient CORDIC array structure for the implementation ofdiscrete cosine transform

IEEE Transactions on Signal Processing
High-throughput VLSI architectures for the 1-D and 2-D discrete cosine transforms

IEEE Transactions on Circuits and Systems for Video Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel approach to compute DCT-I, DCT-III, and DCT-IV. By using a modular mapping and truncating, DCTs are approximated by linear sums of discrete moments computed fast only through additions. This enables us to use computational techniques developed for computing moments to compute DCTs efficiently. We demonstrate this by applying our earlier systolic solution to this problem. The method can also be applied to multidimensional DCTs as well as their inverses.