By Topic

Research on Fast 2-D DCT Algorithm Based on Parallel Computing

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

3 Author(s)
Sun Wenbang ; Sch. of Commun. Eng., Aviation Inf. Dept., Jilin Univ., Changchun, China ; Chen Hexin ; Sun Wenbing

Now, 2-D DCT is applied widely in the field of signal processing. But the transformation is operated by twice 1-D DCT successively, which limits the operation efficiency to improve farther. To overcome such drawbacks, a new method based on parallel computing is proposed in the paper. First, a sort of new matrix operation algorithm and a new transformation matrix are defined in the interest of convenient parallel computing. Then, 2-D DCT is operated integrally based on the new transformation matrix and new matrix operation criterion. The theoretical analysis shows that the calculating amount of the proposed method to compute 2-D DCT only needs one equivalent multiplication and a few equivalent additions, and the operation efficiency relative to other fast algorithms is improved notably.

Published in:

Network Computing and Information Security (NCIS), 2011 International Conference on  (Volume:2 )

Date of Conference:

14-15 May 2011