By Topic

Moment-based fast discrete sine 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

4 Author(s)
J. G. Liu ; Key Lab. of State Educ. Ministry for Image Process. & Intelligent Control, Huazhong Univ. of Sci. & Technol., Wuhan, China ; F. H. Y. Chan ; F. K. Lam ; H. F. Li

This paper presents a novel approach to compute discrete sine transforms (DSTs). By using a modular mapping, DSTs are approximated by the sum of a finite sequence of discrete moments. Hence, by extending our earlier technique in computing moments with an adder network only, DSTs can also be implemented easily by a systolic array primarily involving additions. The method can be applied to multidimensional DSTs as well as their inverses.

Published in:

IEEE Signal Processing Letters  (Volume:7 ,  Issue: 8 )