An efficient algorithm for computing two-dimensional discrete cosine transforms

A fast algorithm for computing the two-dimensional discrete cosine transform (2-D DCT) is proposed. In this algorithm the 2-D DCT is converted into a form of 2-D DFT (discrete Fourier transform) which is called the odd DFT. The odd DFT can be calculated by a DFT followed by post-multiplications. The DFT part of the odd DFT is calculated by the fast discrete Radon transform. The complexity of the proposed algorithm is comparable to that of the polynomial transform approach. This new algorithm produces a regular structure which makes it attractive for VLSI implementation. Furthermore, the computation can be performed in parallel