Chebyshev polynomial derivation of composite-length DCT algorithms

DOI10.1016/0165-1684(92)90096-FzbMath0762.65106OpenAlexW2020060587MaRDI QIDQ1196223

Gabriele Drauschke

Publication date: 17 December 1992

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0165-1684(92)90096-f

zbMATH Keywords

Chebyshev polynomialsfast algorithmsdiscrete cosine transformfast polynomial algorithmsingle- and mixed-radix lengths

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Fourier and Fourier-Stieltjes transforms and other transforms of Fourier type (42A38)

This page was built for publication: Chebyshev polynomial derivation of composite-length DCT algorithms