New Fast and Area-Efficient Pipeline 3-D DCT Architectures

Saad Al-Azawi, O Nibouche, Said Boussakta, G Lightbody

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

The efficient implementation of 3-D transforms is a challenging task due to the computation complexity, memory and area requirements of such transforms. One important 3-D transform is the 3-D Discrete Cosine Transform (3-D DCT) used in many image and video processing systems. In this paper, two new pipeline architectures for the 3-D DCT computation using the 3-D DCT Vector-Radix algorithm (3-D DCT VR) are presented. These architectures are scalable and parameterisable with regards to different wordlengths and pipelining levels. Their arithmetic component requirements are reduced to the order of in contrast with for 3-D DCT architectures in the literature, while at the same time they can keep similar or better area-time complexity.
LanguageEnglish
Article numberDSP-D-18-00187R1
Number of pages13
JournalDigital Signal Processing
Early online date18 Sep 2018
DOIs
Publication statusE-pub ahead of print - 18 Sep 2018

Fingerprint

Discrete cosine transforms
Pipelines
Data storage equipment
Processing

Cite this

@article{0eefefeeec4645c8a601d21ebccbd708,
title = "New Fast and Area-Efficient Pipeline 3-D DCT Architectures",
abstract = "The efficient implementation of 3-D transforms is a challenging task due to the computation complexity, memory and area requirements of such transforms. One important 3-D transform is the 3-D Discrete Cosine Transform (3-D DCT) used in many image and video processing systems. In this paper, two new pipeline architectures for the 3-D DCT computation using the 3-D DCT Vector-Radix algorithm (3-D DCT VR) are presented. These architectures are scalable and parameterisable with regards to different wordlengths and pipelining levels. Their arithmetic component requirements are reduced to the order of in contrast with for 3-D DCT architectures in the literature, while at the same time they can keep similar or better area-time complexity.",
author = "Saad Al-Azawi and O Nibouche and Said Boussakta and G Lightbody",
year = "2018",
month = "9",
day = "18",
doi = "10.1016/j.dsp.2018.09.001",
language = "English",
journal = "Digital Signal Processing",
issn = "1051-2004",
publisher = "Elsevier",

}

New Fast and Area-Efficient Pipeline 3-D DCT Architectures. / Al-Azawi, Saad; Nibouche, O; Boussakta, Said; Lightbody, G.

In: Digital Signal Processing, 18.09.2018.

Research output: Contribution to journalArticle

TY - JOUR

T1 - New Fast and Area-Efficient Pipeline 3-D DCT Architectures

AU - Al-Azawi, Saad

AU - Nibouche, O

AU - Boussakta, Said

AU - Lightbody, G

PY - 2018/9/18

Y1 - 2018/9/18

N2 - The efficient implementation of 3-D transforms is a challenging task due to the computation complexity, memory and area requirements of such transforms. One important 3-D transform is the 3-D Discrete Cosine Transform (3-D DCT) used in many image and video processing systems. In this paper, two new pipeline architectures for the 3-D DCT computation using the 3-D DCT Vector-Radix algorithm (3-D DCT VR) are presented. These architectures are scalable and parameterisable with regards to different wordlengths and pipelining levels. Their arithmetic component requirements are reduced to the order of in contrast with for 3-D DCT architectures in the literature, while at the same time they can keep similar or better area-time complexity.

AB - The efficient implementation of 3-D transforms is a challenging task due to the computation complexity, memory and area requirements of such transforms. One important 3-D transform is the 3-D Discrete Cosine Transform (3-D DCT) used in many image and video processing systems. In this paper, two new pipeline architectures for the 3-D DCT computation using the 3-D DCT Vector-Radix algorithm (3-D DCT VR) are presented. These architectures are scalable and parameterisable with regards to different wordlengths and pipelining levels. Their arithmetic component requirements are reduced to the order of in contrast with for 3-D DCT architectures in the literature, while at the same time they can keep similar or better area-time complexity.

U2 - 10.1016/j.dsp.2018.09.001

DO - 10.1016/j.dsp.2018.09.001

M3 - Article

JO - Digital Signal Processing

T2 - Digital Signal Processing

JF - Digital Signal Processing

SN - 1051-2004

M1 - DSP-D-18-00187R1

ER -