Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs

Details Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs

2007-02-04

arxiv.org/abs/cs/0702025v1

Computer Science

Information Theory

31 pages, more information at http://www.ece.cmu.edu/~smart

Scientific paper

This paper presents a systematic methodology based on the algebraic theory of signal processing to classify and derive fast algorithms for linear transforms. Instead of manipulating the entries of transform matrices, our approach derives the algorithms by stepwise decomposition of the associated signal models, or polynomial algebras. This decomposition is based on two generic methods or algebraic principles that generalize the well-known Cooley-Tukey FFT and make the algorithms' derivations concise and transparent. Application to the 16 discrete cosine and sine transforms yields a large class of fast algorithms, many of which have not been found before.

Affiliated with

Also associated with

No associations

Rating

Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-714230