Back to Search
Start Over
A Storage Efficient Way to Implement the Discrete Cosine Transform
- Source :
- IEEE Transactions on Computers. :764-765
- Publication Year :
- 1976
- Publisher :
- Institute of Electrical and Electronics Engineers (IEEE), 1976.
-
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.
- Subjects :
- Modified discrete cosine transform
Computer science
Discrete-time Fourier transform
Non-uniform discrete Fourier transform
Fast Fourier transform
ComputerApplications_COMPUTERSINOTHERSYSTEMS
Discrete Hartley transform
Discrete Fourier transform
Theoretical Computer Science
Computer Science::Hardware Architecture
symbols.namesake
Discrete Fourier transform (general)
Cyclotomic fast Fourier transform
Hartley transform
Discrete cosine transform
Hardware_ARITHMETICANDLOGICSTRUCTURES
S transform
Computer Science::Databases
Constant Q transform
Continuous wavelet transform
Transform coding
Prime-factor FFT algorithm
Short-time Fourier transform
Fractional Fourier transform
Computational Theory and Mathematics
Discrete sine transform
Split-radix FFT algorithm
Hardware and Architecture
Rader's FFT algorithm
symbols
Harmonic wavelet transform
Algorithm
Software
Data compression
Subjects
Details
- ISSN :
- 00189340
- Database :
- OpenAIRE
- Journal :
- IEEE Transactions on Computers
- Accession number :
- edsair.doi...........8e8496805a3af71861c690b56ab0302e
- Full Text :
- https://doi.org/10.1109/tc.1976.1674687