arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.01566cs.DScs.DMeess.SP
收藏

块长N=4(mod 8)的基于矩阵Laurent级数的快速傅里叶变换

A Matrix Laurent Series-based Fast Fourier Transform for Blocklengths N=4 (mod 8)

H. M. de Oliveira, R. M. Campello de Souza, R. C. de Oliveira

摘要:

提出了一种新的块长8m+4 DFT的快速计算方法,该方法基于一个包含矩阵的Laurent级数.非平凡的实乘法复杂性的结果,提出了块长度N=64,实现较低的乘法计数比以前公布的FFT。给出了m=1和m=2情况下的详细描述。

英文摘要:

General guidelines for a new fast computation of blocklength 8m+4 DFTs are presented, which is based on a Laurent series involving matrices. Results of non-trivial real multiplicative complexity are presented for blocklengths N=64, achieving lower multiplication counts than previously published FFTs. A detailed description for the cases m=1 and m=2 is presented.

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

↑