代数信号处理理论:DCT和DST的Cooley-Tukey型算法
Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for DCTs and DSTs
摘要:
本文提出了一种系统的方法,基于信号处理的代数理论,分类和推导线性变换的快速算法。我们的方法不是操纵变换矩阵的条目,而是通过逐步分解相关的信号模型或多项式代数来推导算法。这种分解是基于两种通用的方法或代数原理,推广了著名的Cooley-Tukey FFT,使算法的推导简洁和透明。应用到16离散余弦和正弦变换产生了一个大类的快速算法,其中许多还没有发现以前。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。