On computing the discrete Fourier and cosine transforms
From MaRDI portal
Publication:3757261
DOI10.1109/TASSP.1985.1164710zbMath0621.65034MaRDI QIDQ3757261
Publication date: 1985
Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)
Related Items (5)
The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms ⋮ Lowest Complexity Self-Recursive Radix-2 DCT II/III Algorithms ⋮ Fast and numerically stable algorithms for discrete cosine transforms ⋮ Parallel vector processing of multidimensional orthogonal transforms for digital signal processing applications ⋮ Multiplierless lifting-based fast X transforms derived from fast Hartley transform factorization
This page was built for publication: On computing the discrete Fourier and cosine transforms
