By Topic

Research on Fast 1-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
$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

4 Author(s)
Yu Guang ; Aviation Inf. Dept., Aviation Univ. of Air Force, Changchun, China ; Sun Wenbang ; Zhou Maiyu ; Cheng Hong

Discrete cosine transform (DCT) is applied widely in the field of signal processing. But the transform operation is complicated, and a large amount of multiply operation and addition operation affect largely the transform efficiency. To overcome such drawback, a new method based on parallel operation is proposed in the paper. First, a new transform matrix and a sort of new matrix operation principle are defined in the interest of convenient parallel operation. Then, DCT is accomplished by parallel operation tidily based on the new transform matrix and the new matrix operation principle. The theoretical analysis shows that the computation sum of the proposed method to compute DCT only needs one equivalent multiplication and a few equivalent additions, and the operation efficiency relative to other fast algorithm is improved markedly.

Published in:

Computer Science and Electronics Engineering (ICCSEE), 2012 International Conference on  (Volume:1 )

Date of Conference:

23-25 March 2012