By Topic

Fast algorithms for the computation of sliding discrete sinusoidal transforms

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

1 Author(s)
V. Kober ; Dept. of Comput. Sci., CICESE, Ensenada, Mexico

Fast algorithms for computing various discrete cosine transforms and discrete sine transforms in a sliding window are proposed. The algorithms are based on a recursive relationship between three subsequent local transform spectra. Efficient inverse algorithms for signal processing in a sliding window are also presented. The computational complexity of the algorithms is compared with that of known fast discrete sinusoidal transforms and running recursive algorithms.

Published in:

IEEE Transactions on Signal Processing  (Volume:52 ,  Issue: 6 )