Fast radix-p discrete cosine transform
- 1 March 1992
- journal article
- Published by Springer Nature in Applicable Algebra in Engineering, Communication and Computing
- Vol. 3 (1) , 39-46
- https://doi.org/10.1007/bf01189022
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- A polynomial approach to fast algorithms for discrete Fourier-cosine and Fourier-sine transformsMathematics of Computation, 1991
- Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Fast Solution of Vandermonde-Like Systems Involving Orthogonal PolynomialsIMA Journal of Numerical Analysis, 1988
- Simple FFT and DCT algorithms with reduced number of operationsSignal Processing, 1984
- A New Algorithm for Discrete Cosine Transform of Arbitrary Number of PointsIEEE Transactions on Computers, 1980
- A fast cosine transform in one and two dimensionsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- On the L2 convergence of collocation for the generalized airfoil equationJournal of Mathematical Analysis and Applications, 1979