arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1805.05533eess.SP
收藏

发现变换:循环矩阵、循环卷积和离散傅里叶变换

Discovering Transforms: A Tutorial on Circulant Matrices, Circular Convolution, and the Discrete Fourier Transform

Bassam Bamieh

摘要:

如果不知道如何假设傅立叶变换和其他变换,怎么能自然地发现它们呢?在离散傅里叶变换(DFT)的情况下,我们展示了它是如何自然产生的循环矩阵的分析。特别地,DFT可以被导出为同时对角化所有循环矩阵的基的变化。这样,DFT自然地从关于一组矩阵的线性代数问题中产生。与其将DFT视为信号变换,不如将其视为将整个相互交换矩阵集合呈现为简单对角形式的基的单个变化。DFT然后可以通过求解该集合中的特殊元素的特征值/特征向量问题来“发现”。一个简要的轮廓给出了如何这条思路可以推广到家庭的线性算子,导致发现其他常见的傅立叶型变换,以及它的连接与群表示理论。

英文摘要:

How could the Fourier and other transforms be naturally discovered if one didn't know how to postulate them? In the case of the Discrete Fourier Transform (DFT), we show how it arises naturally out of analysis of circulant matrices. In particular, the DFT can be derived as the change of basis that simultaneously diagonalizes all circulant matrices. In this way, the DFT arises naturally from a linear algebra question about a set of matrices. Rather than thinking of the DFT as a signal transform, it is more natural to think of it as a single change of basis that renders an entire set of mutually-commuting matrices into simple, diagonal forms. The DFT can then be "discovered" by solving the eigenvalue/eigenvector problem for a special element in that set. A brief outline is given of how this line of thinking can be generalized to families of linear operators, leading to the discovery of the other common Fourier-type transforms, as well as its connections with group representations theory.

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

↑