By Topic

FPGA implementation of a pipelined 2D-DCT and simplified quantization for real-time applications

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hatim Anas ; Embedded Systems and Digital Control Laboratory, National School of Applied Sciences, University of Cadi Ayyad, PB. 575, Av. Abdelkarim Khattabi, Guéliz, Marrakech, Morocco ; Said Belkouch ; M. El Aakif ; Noureddine Chabini

The Discrete Cosine Transform (DCT) is one of the most widely used techniques for image compression. Several algorithms are proposed to implement the DCT-2D. The scaled SDCT algorithm is an optimization of the DCT-1D, which consists in gathering all the multiplications at the end. In this paper, in addition to the hardware implementation on an FPGA, an extended optimization has been performed by merging the multiplications in the quantization block without having an impact on the image quality. Tests using MATLAB environment have shown that our proposed approach produces images with quality comparable to the ones obtained using the JPEG standard. FPGA-based implementations of this proposed approach and the Loeffler's algorithm are proposed and compared in this paper using an Altera Startix FPGA family with the synthesis and implementation tool Quartus II. Results show that our approach outperforms the well known Loeffler's algorithm in terms of processing-speed and resources used.

Published in:

Multimedia Computing and Systems (ICMCS), 2011 International Conference on

Date of Conference:

7-9 April 2011