CAJ | 학술논문

为快速实现短信号序列的离散傅里叶变换，提出一种基于一阶矩的无乘法 DFT 算法。通过数学推导将离散傅里叶变换的计算转换为一阶矩的计算，利用1-网络法实现一阶矩的运算。该算法的计算过程仅涉及加法运算，并能独立计算DFT频域系数。实验结果证明了算法的有效性，特别是在某些条件下优于现有的快速傅里叶算法。
위쾌속실현단신호서렬적리산부리협변환，제출일충기우일계구적무승법 DFT 산법。통과수학추도장리산부리협변환적계산전환위일계구적계산，이용1-망락법실현일계구적운산。해산법적계산과정부섭급가법운산，병능독립계산DFT빈역계수。실험결과증명료산법적유효성，특별시재모사조건하우우현유적쾌속부리협산법。
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.