A new multidimensional recursive architecture for computing the discrete cosine transform

Ayman Elnaggar; Hussein M. Alnuweiri

doi:10.1109/76.825865

A new multidimensional recursive architecture for computing the discrete cosine transform

Ayman Elnaggar^*, Hussein M. Alnuweiri

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

16 Citations (Scopus)

Abstract

This paper presents a novel recursive algorithm for generating higher order multidimensional (m-D) discrete cosing 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.

Original language	English
Pages (from-to)	113-119
Number of pages	7
Journal	IEEE Transactions on Circuits and Systems for Video Technology
Volume	10
Issue number	1
DOIs	https://doi.org/10.1109/76.825865
Publication status	Published - 2000
Externally published	Yes

Keywords

Modular structures
Multidimensional structures
Permutation matrices
Recursive architectures
Tensor products

Access to Document

10.1109/76.825865

Cite this

@article{bb44d58f6c0d4601a18f1806f29f1510,

title = "A new multidimensional recursive architecture for computing the discrete cosine transform",

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.",

keywords = "Modular structures, Multidimensional structures, Permutation matrices, Recursive architectures, Tensor products",

author = "Ayman Elnaggar and Alnuweiri, {Hussein M.}",

year = "2000",

doi = "10.1109/76.825865",

language = "English",

volume = "10",

pages = "113--119",

journal = "IEEE Transactions on Circuits and Systems for Video Technology",

issn = "1051-8215",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "1",

}

TY - JOUR

T1 - A new multidimensional recursive architecture for computing the discrete cosine transform

AU - Elnaggar, Ayman

AU - Alnuweiri, Hussein M.

PY - 2000

Y1 - 2000

N2 - 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.

AB - 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.

KW - Modular structures

KW - Multidimensional structures

KW - Permutation matrices

KW - Recursive architectures

KW - Tensor products

UR - http://www.scopus.com/inward/record.url?scp=0033896427&partnerID=8YFLogxK

U2 - 10.1109/76.825865

DO - 10.1109/76.825865

M3 - Article

AN - SCOPUS:0033896427

SN - 1051-8215

VL - 10

SP - 113

EP - 119

JO - IEEE Transactions on Circuits and Systems for Video Technology

JF - IEEE Transactions on Circuits and Systems for Video Technology

IS - 1

ER -

A new multidimensional recursive architecture for computing the discrete cosine transform

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this