Computation of an odd-length DCT from a real-valued DFT of the same length

DOI10.1109/78.157181zbMath0753.65101OpenAlexW2120787682MaRDI QIDQ3991431

Michael T. Heideman

Publication date: 28 June 1992

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

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

zbMATH Keywords

discrete Fourier transformdiscrete cosine transformmultiplicative complexity

Mathematics Subject Classification ID

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

Related Items (1)

The multiplicative complexity of discrete cosine transforms

This page was built for publication: Computation of an odd-length DCT from a real-valued DFT of the same length