基于一阶矩的DFT脉动阵列快速实现
Efficient Systolic Implementation of DFT Using only the First-order Moments
离散傅里叶变换是数字信号处理领域的一个重要工具，鉴于此，提出了一种新的离散傅里叶变换方法，通过简单的数学推导将离散傅里叶变换计算转换为一阶矩计算；显然，仅仅利用加法就能有效地计算一阶矩，并进一步设计了一个快速脉动阵列来实现离散傅里叶变换，与现有方法相比，所提出的方法更具适用性。
he discrete fourier transform (DFT) is an important tool in digital signal processing. In this paper, a novel approach to DFT is proposed. The computation of DFT is transformed to the computation of the first-order moments by the simple mathematical deductions. It is well known that the first-order moments can be computed efficiently using only additions. An efficient systolic array is designed to implement DFT. The comparison with the existing methods shows the advantages of our method. The approach is also applicable to DFT inverses.
刘振丙、刘建国
计算技术、计算机技术电子技术应用
模式识别与智能系统FT脉动阵列一阶矩
Pattern Recognition and Intelligence SystemsDFTsystolicfirst-order moments
刘振丙,刘建国.基于一阶矩的DFT脉动阵列快速实现[EB/OL].(2011-01-26)[2025-08-02].http://www.paper.edu.cn/releasepaper/content/201101-1272.点此复制
评论