A refined fast 2-D discrete cosine transform algorithm

An index permutation-based fast two-dimensional discrete cosine transform (2-D DCT) algorithm is presented. It is shown that the N/spl times/N 2-D DCT, where N=2/sup m/, can be computed using only N 1-D DCTs and some post additions.