New fast recursive algorithms for the computation of discretecosine and sine transforms

Authors:
Z. Cvetkovic;M.V. Popovic
Affiliations:
Fac. of Electr. Eng., Belgrade Univ.;-
Venue:
IEEE Transactions on Signal Processing
Year:
1992

Citing 0
Cited 7

Algorithm 749: fast discrete cosine transform

ACM Transactions on Mathematical Software (TOMS)
An Efficient IDCT Processor Design for HDTV Applications

Journal of VLSI Signal Processing Systems
Applying an XC6200 to Real-Time Image Processing

IEEE Design & Test
Bilinear algorithms for discrete cosine transforms of prime lengths

Signal Processing - Signal processing in UWB communications
Reversible integer-to-integer mapping of N-point orthonormal block transforms

Signal Processing
Fast mode dependent directional transform via butterfly-style transform and integer lifting steps

Journal of Visual Communication and Image Representation
Two-dimensional fast cosine transform for Vector-STA architectures

SAMOS'05 Proceedings of the 5th international conference on Embedded Computer Systems: architectures, Modeling, and Simulation

Quantified Score

Hi-index	35.68

Visualization

Abstract

Fast recursive algorithms for the computation of the discrete cosine and sine transforms are developed. An N-point discrete cosine transform (DCT) or discrete sine transform (DST) can be computed from two N/2-point DCTs or DSTs. Compared to the existing algorithms the algorithms have less multiplications by two, and add operations are better positioned, giving rise to faster computation and easier VLSI implementation