Barry G. Sherlock
Abstract
An in-place algorithm for the fast, direct computation of the forward and inverse discrete cosine transform is presented and evaluated. The transform length may be an arbitrary power of two.
Supplemental Material
Available for Download
Software for "Fast discrete cosine transform"
- AHMED, N., NATARAJAN, T., AND RAO, K. R. 1974. Discrete cosine transform. IEEE Trans. Comput. C-23, i (Jan.), 90-93.Google Scholar
Digital Library
- CHAN, S.-C. AND HO, K.-L. 1992. Fast algorithms for computing the discrete cosine transform. IEEE Trans. Circuzts Syst. H 39, 3 (Mar.), 185-190.Google Scholar
- CttEN, W.-H., SMITH, C. H., AND FRALICK, S.C. 1977. A fast computational algorithm for the discrete cosine transform. IEEE Trans. Commun. COM-25, 9 (Sept.), 1004 1009.Google Scholar
- CVETKOVIC, Z. AND POPOVIC, M.V. 1992. New fast recursive algorithms for the computation of discrete cosine and sine transforms. IEEE Trans. Signal Process. SP-40, 8 (Aug.), 2083-2086. Google ScholarDigital Library
- Hou, H. S. 1987. A fast recursive algorithm for computing the discrete cosine transform. IEEE Trans. Acoust. Speech S~gnal Process. ASSP-35, 10 (Oct.), 1455-1461.Google Scholar
- LEE, B.G. 1984. A new algorithm to compute the discrete cosine transform. IEEE Trans. Acoust Speech Signal Process. ASSP-32, 6 (Dec.), 1243-1245.Google Scholar
- LI, W. 1991. A new algorithm to compute the DCT and its inverse. IEEE Trans. Signal Process. 39, 6 (June), 1305-1313.Google ScholarDigital Library
- MAKHOUL, J. 1980. A fast cosine transform in one and two dimensions. IEEE Trans. Acoust. Speech S,gnal Proces,~. ASSP-28, 1 (Feb.), 27-34.Google ScholarCross Ref
- MALVAR, H. S. 1986. Fast computation of the discrete cosine transform through the fast Hartley transform. Elec. Lett. 27, (Mar.), 352-353.Google ScholarCross Ref
- MONRO, D.M. 1979. Interpolation by fast Fourier and Chebyshev transforms. Int. J. Num. Methods Eng. 14, 11, 1679-1692.Google ScholarCross Ref
- NARASmHA, M. J. AND PETERSON, A. M. 1978. On the computation of the discrete cosine transform. IEEE Trans. Commun. COM-26, 6 (June), 934-936.Google Scholar
- RAO, K. R. AND YIP, P. 1990. Discrete Cosine Transform: Algorithms, Advantages, Appltcations. Academic Press, New York. Google ScholarDigital Library
- SKODRAS, A. N. AND CHmSTOPOULOS, C.A. 1993. Split-radix fast cosine transform algorithm. Int. J. Elec. 74, 4 (Apr.), 513-522.Google Scholar
- WANG, Z. 1984. Fast algorithms for the discrete W transform and for the discrete Fourier transform. IEEE Trans. Acoust. Speech S~gnal Process. ASSP-32, 4 (Aug.), 803-816.Google ScholarCross Ref
- YIP, P. AND RAO, K.R. 1988. The decimation-in-frequency algorithms for a family of discrete sine and cosine transforms. Circuits Syst. Signal Process. 7, 1, 3-19.Google ScholarCross Ref
Index Terms
- Algorithm 749: fast discrete cosine transform
Recommendations
Fast Three-Dimensional Discrete Cosine Transform
* Special Issue on Computational Science and EngineeringA fast three-dimensional discrete cosine transform algorithm (3D FCT) and a fast 3D inverse cosine transform (3D IFCT) algorithm are presented, suitable for analysis of 3D data points. Many existing algorithms for three-dimensional data points make use ...
The Fast Hartley Transform Algorithm
The fast Hartley transform (FHT) is similar to the Cooley-Tukey fast Fourier transform (FFT) but performs much faster because it requires only real arithmetic computations compared to the complex arithmetic computations required by the FFT. Through use ...
Fast radix-p discrete cosine transform
A new fast radix-p-algorithm (p ? 2) for the discrete cosine transform (DCT) and its inverse is presented. It is based on the divide-and-conquer method and on the arithmetic with Chebyshev polynomials. The algorithm can be applied for the efficient ...
Comments