有限阿贝尔群的矩阵、有限傅里叶变换与码
Matrices of finite abelian groups, Finite Fourier Transform and codes
摘要:
有限(或离散)傅里叶变换(FFT)是基于信号传输的工程学科中的基本工具,在大多数情况下都是如此。FFT与循环矩阵有关,循环矩阵可以看作是循环群的群矩阵。在这方面,我们介绍了一个推广的情况下,有限群,交换或不以前的调查。我们明确的点,这是不承认的基本代数结构。特别地,从有限群的线性表示的观点阐明了工程上FFT中出现的所有问题。我们为工程学科的读者提供了许多计算实例。
英文摘要:
Finite (or Discrete) Fourier Transforms (FFT) are essential tools in engineering disciplines based on signal transmission, which is the case in most of them. FFT are related with circulant matrices, which can be viewed as group matrices of cyclic groups. In this regard, we introduce a generalization of the previous investigations to the case of finite groups, abelian or not. We make clear the points which were not recognized as underlying algebraic structures. Especially, all that appears in the FFT in engineering has been elucidated from the point of view of linear representations of finite groups. We include many worked-out examples for the readers in engineering disciplines.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。