High precision and low power DCT architectures for image compression applications

Al-Azawi, Saad; Boussakta, S.; Yakovlev, Alex

doi:10.1049/cp.2012.0460

Cited by 4 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Numerous 1-D and 2-D DCT architectures have been suggested in the literature [30][31][32][33][34][35][36][37][38][39]. Exploiting the separability principle of the transform, 2-D DCT cores based on the 1-D DCT Row-Column (RC) approach are suggested in [33][34][35][36]; yet very few architectures that implement the 3-D DCT can be found [38][39][40][41][42][43][44][45]. Traditionally, the 3-D DCT has been implemented by cascading stages of the 1-D DCT as in the well-known Row-Column-Frame (RCF) approach.…”

Section: Introductionmentioning

confidence: 99%

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

Al-Azawi

Nibouche²,

Boussakta

et al. 2019

Digital Signal Processing

View full text Add to dashboard Cite

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 ( 2 ) 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.

show abstract