ePrints

New fast and area-efficient pipeline 3-D DCT architectures

Lookup NU author(s): Saad Al-Azawi, Dr Omar Nibouche, Professor Said Boussakta

Downloads

• Accepted version [.pdf]

Licence

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License (CC BY-NC-ND).

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 O(log2N)in contrast with O(N)for 3-D DCT architectures in the literature, while at the same time they can keep similar or better area-time complexity.

Publication metadata

Author(s): Al-Azawi S, Nibouche O, Boussakta S, Lightbody G

Publication type: Article

Publication status: Published

Journal: Digital Signal Processing

Year: 2019

Volume: 84

Pages: 15-25

Print publication date: 01/01/2019

Online publication date: 18/09/2018

Acceptance date: 01/09/2018

Date deposited: 23/10/2018

ISSN (print): 1051-2004

ISSN (electronic): 1095-4333

Publisher: Academic Press

URL: https://doi.org/10.1016/j.dsp.2018.09.001

DOI: 10.1016/j.dsp.2018.09.001

Altmetrics

Share