By Topic

On the algorithms for the computation of even discrete cosine transform-2 (EDCT-2) of real sequences

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)
N. Ramamurthy ; Fac. of Eng. & Comput. Sci., Concordia Univ., Montreal, Que., Canada ; M. N. S. Swamy

An algorithm based on O2DFT (odd-time odd-frequency discrete Fourier transform) is presented for the computation of the EDCT-2 of purely real sequences. Comparison of this algorithm with two others available in the literature shows that it is computationally superior for EDCT-2 evaluation of real sequences (N>8). Its computational advantage is based on its lesser real multiplication requirements

Published in:

IEEE Transactions on Circuits and Systems  (Volume:37 ,  Issue: 5 )