Fast computation of two-dimensional discrete cosine transforms using fast discrete Radon transform

摘要

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.