Share Email Print

Proceedings Paper

Low complexity DCT engine for image and video compression
Author(s): Maher Jridi; Yousri Ouerhani ; Ayman Alfalou
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper, we defined a low complexity 2D-DCT architecture. The latter will be able to transform spatial pixels to spectral pixels while taking into account the constraints of the considered compression standard. Indeed, this work is our first attempt to obtain one reconfigurable multistandard DCT. Due to our new matrix decomposition, we could define one common 2D-DCT architecture. The constant multipliers can be configured to handle the case of RealDCT and/or IntDCT (multiplication by 2). Our optimized algorithm not only provides a reduction of computational complexity, but also leads to scalable pipelined design in systolic arrays. Indeed, the 8 × 8 StdDCT can be computed by using 4×4 StdDCT which can be obtained by calculating 2×2 StdDCT. Besides, the proposed structure can be extended to deal with higher number of N (i.e. 16 × 16 and 32 × 32). The performance of the proposed architecture are better when compared with conventional designs. In particular, for N = 4, it is found that the proposed design have nearly third the area-time complexity of the existing DCT structures. This gain is expected to be higher for a greater size of 2D-DCT.

Paper Details

Date Published: 19 February 2013
PDF: 9 pages
Proc. SPIE 8656, Real-Time Image and Video Processing 2013, 86560F (19 February 2013); doi: 10.1117/12.2006174
Show Author Affiliations
Maher Jridi, ISEN Brest (France)
Yousri Ouerhani , ISEN Brest (France)
Ayman Alfalou, ISEN Brest (France)

Published in SPIE Proceedings Vol. 8656:
Real-Time Image and Video Processing 2013
Nasser Kehtarnavaz; Matthias F. Carlsohn, Editor(s)

© SPIE. Terms of Use
Back to Top