| 引用本文: | 黄新民.DFT 的新算法.[J].国防科技大学学报,1982,(4):165-177.[点击复制] |
| Huang Xinmin.The New Algorithm of DFT[J].Journal of National University of Defense Technology,1982,(4):165-177[点击复制] |
|
| |
|
|
| 本文已被：浏览 5293次 下载 5063次 |
| DFT 的新算法 |
| 黄新民 |
|
()
|
| 摘要: |
| 本文通过对离散富里叶变换 (Discrete Fourier Transform，简记作 DFT)矩阵的分解与FFT算法相结合，提出了一个计算 DFT的新算法。由对矩阵的分解把求N=2t点的 DFT 问题化为求16 个N/16 阶方阵与相应列向量相乘的问题(N≥16)。从而减少了乘法运算次数，且还具有良好的并行运算性质。 |
| 关键词: |
| DOI： |
| 投稿日期：1982-05-08 |
| 基金项目: |
|
| The New Algorithm of DFT |
| Huang Xinmin |
| Abstract: |
| By dissolving Discrete Fourier Transform matrix and combining with the FFT algorithm，this paper has put out a new method to compute DFT. Because of dissolving the matrix，one can change the problem of extracting DFT of N=2t points into a problem to multiply 16 square matrixes of N/16 order with the corresponding column vectors (N≥16). Thus，this method Can decrease the calculating times and has a satisfied parallel algorithm features. |
| Keywords: |
|
|
