A new multidimensional recursive architecture for computing the discrete cosine transform

This paper presents a novel recursive algorithm for generating higher order multidimensional (m-D) discrete cosine transform (DCT) by combining the computation of 2^m identical lower order (smaller size) DCT architectures. One immediate outcome of our results is the true “scalability” of the DCT computation. Basically, an m-D DCT computation can be constructed from exactly one stage of smaller DCT computations of the same dimension. This is useful for both hardware and software solutions, in which a very efficient smaller size m-D DCT core has been developed, and a larger DCT computation is required. The resulting DCT networks have very simple modular structure, highly regular topology, and use simple arithmetic units