By Topic

DCT algorithms for composite sequence lengths

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)
Guoan Bi ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Inst., Singapore ; Yu, L.W.

This paper presents fast algorithms for the type-II and -III discrete cosine transforms of composite sequence length. In particular, a radix-q algorithm, where q is an odd integer, is derived for uniform or mixed radix decomposition of the discrete cosine transform. By combining the radix-q and radix-2 algorithms, a general decomposition method for any composite length is developed. Reduction of computational complexity can be achieved for many sequence lengths compared with that needed by the well-known radix-2 algorithm. Furthermore, both the proposed and Chan and Siu's (1993) mixed radix algorithms achieve the same computational complexity for N=3*2p and 9*2P. However, our algorithm uses a simpler decomposition approach and provides a wider range of choices of sequence lengths

Published in:

Signal Processing, IEEE Transactions on  (Volume:46 ,  Issue: 3 )