Fast algorithms for computing the discrete cosine transform

DOI10.1109/82.127302zbMath0752.65095OpenAlexW2140215930MaRDI QIDQ4004649

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

fast algorithmsdiscrete Fourier transformpermutationdiscrete cosine transformindex mappingsign changingbutterfly operation

Mathematics Subject Classification ID

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

Related Items (1)

Biorthogonal recombination nonuniform cosine-modulated filter banks and their multiplier-less realizations

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