Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
<|reference_start|>Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs: 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.<|reference_end|>
@article{pueschel2007algebraic,
    title={Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for
  DCTs and DSTs},
    author={Markus Pueschel and Jose M. F. Moura},
    journal={IEEE Transactions on Signal Processing, Vol. 56, No. 4, pp.
  1502-1521, 2008},
    year={2007},
    doi={10.1109/TSP.2007.907919},
    archivePrefix={arXiv},
    eprint={cs/0702025},
    primaryClass={cs.IT cs.DS math.IT}
}