Old Web
Fast computation of two-dimensional discrete cosine transforms using fast discrete radon transform
1991
A new fast algorithm is presented for computing the two-dimensional discrete cosine transform (2D DCT) using the fast discrete Radon transform. The algorithm has the lowest number of multiplications compared with other algorithms. Furthermore, the algorithm is well suited for parallel implementation.
Keywords:
- Non-uniform discrete Fourier transform
- Discrete sine transform
- Prime-factor FFT algorithm
- Discrete Fourier transform (general)
- Discrete mathematics
- Discrete Hartley transform
- Rader's FFT algorithm
- Mathematics
- Cyclotomic fast Fourier transform
- Discrete cosine transform
- Lapped transform
- Electronic engineering
- Algorithm
- Radon transform
- Modified discrete cosine transform
- Mathematical analysis
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
0
References
2
Citations
NaN
KQI