Algorithm 749: fast discrete cosine transform

Authors:
Barry G. Sherlock;Donald M. Monro
Affiliations:
Parks College of Saint Louis Univ., Cahokia, IL;Univ. of Bath, Bath, UK
Venue:
ACM Transactions on Mathematical Software (TOMS)
Year:
1995

Citing 2
Cited 2

Discrete cosine transform: algorithms, advantages, applications

Discrete cosine transform: algorithms, advantages, applications
New fast recursive algorithms for the computation of discretecosine and sine transforms

IEEE Transactions on Signal Processing

Reversible integer-to-integer mapping of N-point orthonormal block transforms

Signal Processing
Sturm root counting using chebyshev expansion

ACM Communications in Computer Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

An in-place algorithm for the fast, direct computation of the forward and inverse discrete cosine transform is presented and evaluated. The transform length may be an arbitrary power of two.