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 cosing transform (DCT) by combining the co mputation of 2(m) identical Lower order (smaller size) DCT architectures. O ne immediate outcome of our results is the true "scalability" of the DCT co mputation. Basically, an m-D DCT computation can be constructed from exactl y one stage of smaller DCT computations of the same dimension. This is usef ul for both hardware and software solutions, in which a very efficient smal ler size m-D DCT core has been developed, and a larger DCT computation is r equired. The resulting DCT networks have very simple modular structure, hig hly regular topology, and use simple arithmetic units.