19 February 2013 Low complexity DCT engine for image and video compression
Author Affiliations +
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.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Maher Jridi, Yousri Ouerhani , Ayman Alfalou, "Low complexity DCT engine for image and video compression", Proc. SPIE 8656, Real-Time Image and Video Processing 2013, 86560F (19 February 2013); doi: 10.1117/12.2006174; https://doi.org/10.1117/12.2006174


Preprocessing of compressed digital video
Proceedings of SPIE (December 29 2000)
A second order residual (SOR) coding approach to high bit...
Proceedings of SPIE (January 18 2010)
Real-time implementation of JPEG encoder/decoder
Proceedings of SPIE (June 18 1998)
A JPEG 2000 demonstration board
Proceedings of SPIE (August 18 2005)

Back to Top