2008
DOI: 10.1109/tsp.2007.907919
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 wellknown Cooley-Tukey FFT and make the algorithms' derivations concise and transpar… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
85
0

Year Published

2008
2008
2019
2019

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 81 publications
(85 citation statements)
references
References 67 publications
(163 reference statements)
0
85
0
Order By: Relevance
“…This would be particularly powerful as it enables the application of a vast array of results from a signal processing point of view and in particular, recent novel results from algebraic signal processing [11][12][13][14][15][16] will find ground-breaking applications.…”
Section: A Backgroundmentioning
confidence: 99%
“…This would be particularly powerful as it enables the application of a vast array of results from a signal processing point of view and in particular, recent novel results from algebraic signal processing [11][12][13][14][15][16] will find ground-breaking applications.…”
Section: A Backgroundmentioning
confidence: 99%
“…3 (bottom), in the same way as the DFT is associated with the time shift. Third, knowing those signal models is the key to deriving and understanding the DTTs' fast algorithms [7], [9].…”
Section: Finite 1-d Space Models and Dttsmentioning
confidence: 99%
“…The polynomial DTTs will play an important role in the derivation of fast DTT algorithms [7]. Also, in some cases the polynomial DTTs have a lower complexity than the actual DTT.…”
Section: Dtt Dttmentioning
confidence: 99%
See 2 more Smart Citations