By Topic

A novel architecture for fast 2D IDCT decoders, with reduced number of multiplications

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
$31 $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

2 Author(s)
Tziortzios, T. ; Dept. of Electr. & Comput. Eng., Aristotle Univ. of Thessaloniki, Thessaloniki, Greece ; Dokouzyannis, S.

This paper presents a new architecture for the fast computation of the 8×8 two dimensional (2D) Inverse Discrete Cosine Transform (IDCT). The key idea of the proposed method is the permanent storage of the Basis Matrices of the 8×8 2D Discrete Cosine Transform (DCT). By exploiting the sparseness property of the 2D DCT coefficient matrix, the computational time decreases as the number of nonzero coefficients decreases. Moreover, by exploiting the symmetry properties inherent in the Basis Matrices, the introduced method reduces the number of multipliers as well as the number of required multiplications. The proposed structure computes all 64 pixel luminance values of an 8×8 block simultaneously. The efficiency of the proposed architecture is validated through simulations.

Published in:

Consumer Electronics, IEEE Transactions on  (Volume:57 ,  Issue: 3 )