| 基于一阶矩的无乘法DFT算法 |
| |
| 引用本文： | 何其佳,刘振丙.基于一阶矩的无乘法DFT算法[J].桂林电子科技大学学报,2014(3):193-196. |
| |
| 作者姓名： | 何其佳 刘振丙 |
| |
| 作者单位： | 桂林电子科技大学电子工程与自动化学院,广西桂林541004 |
| |
| 基金项目： | 广西自然科学基金（2013GXNSFBA019279） |
| |
| 摘 要： | 为快速实现短信号序列的离散傅里叶变换,提出一种基于一阶矩的无乘法DFT算法。通过数学推导将离散傅里叶变换的计算转换为一阶矩的计算,利用1-网络法实现一阶矩的运算。该算法的计算过程仅涉及加法运算,并能独立计算DFT频域系数。实验结果证明了算法的有效性,特别是在某些条件下优于现有的快速傅里叶算法。
|
| 关 键 词： | 离散傅里叶变换 一阶矩 -网络法 |
A novel DFT algorithm without multiplication based on first-order moment |
| |
| He Qijia,Liu Zhenbing.A novel DFT algorithm without multiplication based on first-order moment[J].Journal of Guilin Institute of Electronic Technology,2014(3):193-196. |
| |
| Authors: | He Qijia Liu Zhenbing |
| |
| Affiliation: | (School of Electronic Engineering and Automation, Guilin University of Electronic Technology, Guilin 541004,China) |
| |
| Abstract: | In order to make DFT computation more quickly when the signal length is short,a novel algorithm without multi-plication is proposed.The computation of DFT is transformed to the computation of the first-order moment by the mathe-matical deductions,then 1-network is used to compute the first-order moment,which uses only addition and can compute the DFT frequency coefficients.The experimental result shows the algorithm is effective,and it is better than FFT in some cases. |
| |
| Keywords: | DFT first-order moment 1-network |
| 本文献已被 CNKI 维普 等数据库收录！ |
