arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1008.2972cs.ITmath.ITmath.RA
收藏

代数信号处理理论:基于归纳的多项式变换的Cooley-Tukey型算法

Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for Polynomial Transforms Based on Induction

Aliaksei Sandryhaila, Jelena Kovacevic, Markus Pueschel

摘要:

多项式变换是输入向量$x\in\C^n$与矩阵$\PT_{b,α}\in\C^{n\times n},$的乘积,对于来自列表$b=\{p_0(x),\dots,p_{n-1}(x)\}$的多项式$p_\ell(x)\in\C[x]$和来自列表$α=\{α_0,\dots,α_{n-1}\}$的采样点$α_k\in\C$,矩阵$\PT_{b,α}\in\C^{n\times n},$的第$(k,\ell)$个元素被定义为$p_\ell(α_k)$。这种变换在信号处理、数据压缩和函数插值领域中有应用。重要的例子包括离散傅立叶和余弦变换。在本文中,我们介绍了一种新的技术,得到快速算法的多项式变换。该技术使用多项式变换和多项式代数的表示理论之间的关系。具体来说,我们通过将这些代数的正则模分解为逐步归纳法来推导算法。作为一个应用,我们推导出新的$O(n\log{n})$一般基数算法的离散傅立叶变换和离散余弦变换的类型4。

英文摘要:

A polynomial transform is the multiplication of an input vector $x\in\C^n$ by a matrix $\PT_{b,α}\in\C^{n\times n},$ whose $(k,\ell)$-th element is defined as $p_\ell(α_k)$ for polynomials $p_\ell(x)\in\C[x]$ from a list $b=\{p_0(x),\dots,p_{n-1}(x)\}$ and sample points $α_k\in\C$ from a list $α=\{α_0,\dots,α_{n-1}\}$. Such transforms find applications in the areas of signal processing, data compression, and function interpolation. Important examples include the discrete Fourier and cosine transforms. In this paper we introduce a novel technique to derive fast algorithms for polynomial transforms. The technique uses the relationship between polynomial transforms and the representation theory of polynomial algebras. Specifically, we derive algorithms by decomposing the regular modules of these algebras as a stepwise induction. As an application, we derive novel $O(n\log{n})$ general-radix algorithms for the discrete Fourier transform and the discrete cosine transform of type 4.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑