By Topic

New radix-3 fast algorithm for the 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
$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

2 Author(s)
Yiquan Wu ; Dept. of Electron. Eng., Nanjing Aeronaut. Inst., China ; Zhaoda Zhu

In this paper a new radix-3 fast algorithm for the length -3m discrete cosine transform (DCT) is proposed, to further extend the applicability of the fast cosine transform (FCT) algorithm. First, the basic 3-point DCT is considered. Then, the formulae of the new radix-3 FCT algorithm are derived. Next, a block diagram of the radix-3 FCT algorithm is shown and the signal flowgraph for length-32 FCT is given to illustrate the proposed algorithm. Finally, the computational complexity is analysed. The proposed algorithm requires less number of arithmetic operations and allows in-place computation. The simple and regular structure makes it easy to be implemented. One can compute effectively the length-21·3m DCT using this length-3m algorithm together with the existing length-21 algorithm by prime factor decomposition. The proposed new radix-3 FCT algorithm is expected to find wide practical applications

Published in:

Aerospace and Electronics Conference, 1993. NAECON 1993., Proceedings of the IEEE 1993 National

Date of Conference:

24-28 May 1993