July 1, 1976

A Storage Efficient Way to Implement the Discrete Cosine Transform

Key Points

Key points are not available for this paper at this time.

Abstract

Ahmed has shown that a discrete cosine transform can be implemented by doing one double length fast Fourier transform (FFT). In this correspondence, we show that the amount of work can be cut to doing two single length FFT's.

Demander à l'IA

Bookmark

Cite This Study

Haralick (Thu,) studied this question.

synapsesocial.com/papers/6a1552d05347fbb1739f97ff https://doi.org/https://doi.org/10.1109/tc.1976.1674687

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1Comments on "Discrete Cosine Transform"1975 · 33 citations
2On the asymptotic eigenvalue distribution of Toeplitz matrices1972 · 523 citations
3Discrete Cosine Transform1974 · 5,002 citations
4Toeplitz and Circulant Matrices: A Review2005 · 768 citations
5Spatial Transform Coding of Color Images1971 · 107 citations

Demander à l'IA

Bookmark