A new multidimensional recursive architecture for computing the discrete cosine transform

Ayman Elnaggar, Hussein M. Alnuweiri

Research output: Contribution to journalArticle

15 Citations (Scopus)


This paper presents a novel recursive algorithm for generating higher order multidimensional (m-D) discrete cosing transform (DCT) by combining the computation of 2m 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.

Original languageEnglish
Pages (from-to)113-119
Number of pages7
JournalIEEE Transactions on Circuits and Systems for Video Technology
Issue number1
Publication statusPublished - 1 Dec 2000


  • Modular structures
  • Multidimensional structures
  • Permutation matrices
  • Recursive architectures
  • Tensor products

ASJC Scopus subject areas

  • Media Technology
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'A new multidimensional recursive architecture for computing the discrete cosine transform'. Together they form a unique fingerprint.

  • Cite this