Restructured recursive DCT and DST algorithms
Authors:
- PeiZong LeePLPeiZong Lee
- Fang-Yu HuangFHFang-Yu Huang
- 1 July 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 42 (7) , 1600-1609
Abstract
No abstract availableThis publication has 27 references indexed in Scilit:
- Computation of an odd-length DCT from a real-valued DFT of the same lengthIEEE Transactions on Signal Processing, 1992
- An efficient FFT algorithm based on the discrete sine transformIEEE Transactions on Signal Processing, 1991
- A fast recursive algorithm for the discrete sine transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1990
- The decimation-in-frequency algorithms for a family of discrete sine and cosine transformsCircuits, Systems, and Signal Processing, 1988
- A two-dimensional fast cosine transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1985
- On computing the discrete Fourier and cosine transformsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1985
- Fast decimation-in-time algorithms for a family of discrete sine and cosine transformsCircuits, Systems, and Signal Processing, 1984
- A Fast Computational Algorithm for the Discrete Sine TransformIEEE Transactions on Communications, 1980
- A Storage Efficient Way to Implement the Discrete Cosine TransformIEEE Transactions on Computers, 1976
- A Fast Direct Solution of Poisson's Equation Using Fourier AnalysisJournal of the ACM, 1965