Fast algorithms for computing the discrete cosine transform

DOI10.1109/82.127302MaRDI QIDQ4004649zbMATH OpenOpenAlexFDO

Authors Shing-Chow Chan, Ka-Leung Ho

Publication date 27 September 1992

Published in IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/82.127302

zbMATH Keywords

permutationdiscrete Fourier transformdiscrete cosine transformfast algorithmsindex mappingsign changingbutterfly operation

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50)

Recommendations

• Efficient index mapping for computing discrete cosine transform
• Fast algorithms for the discrete cosine transform
• Computation of an odd-length DCT from a real-valued DFT of the same length
• Fast odd discrete cosine transform algorithms
• scientific article; zbMATH DE number 4197369

Cited in

(25)

• Fast odd discrete cosine transform algorithms
• Fast algorithms for the discrete cosine transform
• A new fast algorithm for computing prime-Length DCT through cyclic convolutions.
• A fast computational method for minimum square error transform
• Canonical transformations of the discrete cosine transform
• Comments on ``Canonical transformations of the discrete cosine transform
• Simple FFT and DCT algorithms with reduced number of operations.
• Fast Three-Dimensional Discrete Cosine Transform
• Discrete cosine transform in error control coding
• A generalized fast algorithm for n-D discrete cosine transform and its application to motion picture coding
• DCT-former: efficient self-attention with discrete cosine transform
• scientific article; zbMATH DE number 4131613 (Why is no real title available?)
• scientific article; zbMATH DE number 47594 (Why is no real title available?)
• Fast DCT-I, DCT-III, and DCT-IV via moments
• Fast algorithms for the discrete cosine transformation
• Constant geometry algorithm for discrete cosine transform
• An economical method for compression of Fourier cosine transformations.
• Discrete cosine and sine transforms-regular algorithms and pipeline architectures
• Compact recursive structures for discrete cosine transform
• scientific article; zbMATH DE number 621949 (Why is no real title available?)
• On computing the discrete Fourier and cosine transforms
• Biorthogonal recombination nonuniform cosine-modulated filter banks and their multiplier-less realizations
• Type-II/III DCT/DST algorithms with reduced number of arithmetic operations
• Numerical stability of fast cosine transforms
• The Arithmetic Cosine Transform: Exact and Approximate Algorithms

This page was built for publication: Fast algorithms for computing the discrete cosine transform

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4004649)