A new multidimensional recursive architecture for computing the discrete cosine transform Academic Article

abstract

• 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. 2000 IEEE.

authors

• Alnuweiri, Hussein

published proceedings

• IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY

altmetric score

• 3

author list (cited authors)

• Elnaggar, A., & Alnuweiri, H. M.

citation count

• 15

complete list of authors

• Elnaggar, A||Alnuweiri, HM

publication date

• December 2000

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE transactions on circuits and systems for video technology (Print)  Journal

keywords

• Modular Structures
• Multidimensional Structures
• Permutation Matrices
• Recursive Architectures
• Tensor Products

Digital Object Identifier (DOI)

• 10.1109/76.825865

start page

• 113

end page

• 119

volume

• 10

issue

• 1

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2F76.825865