Prime factor algorithm for multidimensional discrete cosine transform

A prime factor fast algorithm is proposed for the computation of the multidimensional forward and inverse discrete cosine transform (DCT). By using an example of a two-dimensional (2-D) DCT, it shows that an r-dimensional DCT can be obtained from a 2r dimensional DCT with a post-processing stage, efficient method for input/output mapping is reported to substantially reduce the computational overhead associated with the prime factor algorithm.