Moment-based fast discrete sine transforms (original) (raw)
2000, IEEE Signal Processing Letters
This paper presents a novel approach to compute discrete sine transforms (DST's). By using a modular mapping, DST's 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, DST's can also be implemented easily by a systolic array primarily involving additions. The method can be applied to multidimensional DST's as well as their inverses.
Sign up for access to the world's latest research.
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.