By Topic

Fast Algorithm for Arbitrary Length Discrete Cosine Transform

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)
Cheng Huang ; Coll. of Electron. Inf. Eng., Jiangsu Teachers Univ. of Technol., Changzhou, China ; Youlian Zhu

Based on discrete Hartley transform algorithm, the proposed fast algorithm is implemented by the parallel Hopfield neural network which can shorten the computation length of discrete cosine transform to achieve high computation speed. The computation complexity of the proposed method is reduced comparing with the others. According to the proposed algorithm which can implement the arbitrary length of discrete cosine transform, the N-point discrete cosine transform requires 2(N-1) real multiplications and 3N-2 real additions. Thus, the algorithm has a better application prospect in signal processing.

Published in:

Natural Computation, 2009. ICNC '09. Fifth International Conference on  (Volume:2 )

Date of Conference:

14-16 Aug. 2009