arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.15218eess.SPcs.NAmath.NAstat.CO
收藏

基于素因子算法的无乘法器DFT近似

Multiplierless DFT Approximation Based on the Prime Factor Algorithm

Universidade Estadual de Campinas(坎皮纳斯州立大学);Industrial Signal Processing Laboratory, Universidade Federal de Pernambuco(伯南布哥联邦大学工业信号处理实验室);LACESM, Universidade Federal de Santa Maria(圣玛丽亚联邦大学LACESM);Department of Mathematics and Natural Sciences, Blekinge Institute of Technology(布莱金厄理工学院数学与自然科学系)

L. Portella, F. M. Bayer, R. J. Cintra

AI总结:

本文提出基于素因子算法的无乘法器DFT近似方法,通过消除中间乘法步骤和误差传播,实现低复杂度和高精度的DFT近似。

摘要:

矩阵近似方法已成功产生出高效的、低复杂度的近似变换用于离散余弦变换和离散傅里叶变换。对于DFT的情况,文献档案中提供了在小的2的幂次块长度(如{8, 16, 32})或大块长度(如1024)上工作的近似方法,这些方法是通过基于Cooley-Tukey的近似方法获得的,该方法依赖于小块长度的近似变换。基于Cooley-Tukey的近似方法继承了中间乘以混叠因子的乘法步骤,这些因子通常不被近似;否则,误差传播将阻止整体的良好性能。在此背景下,素因子算法可以提供必要的框架,用于推导完全无乘法器的DFT近似。我们介绍了一种基于小素数长度DFT近似的近似方法,该方法完全消除了中间乘法步骤并防止内部误差传播。为了展示所提出的方法,我们设计了一个基于3点、11点和31点DFT近似的完全无乘法器的1023点DFT近似。根据流行的度量标准进行性能评估,所提出的近似方法不仅表现出显著降低的算术复杂度,还比竞争方法产生了更小的近似误差测量。

英文摘要:

Matrix approximation methods have successfully produced efficient, low-complexity approximate transforms for the discrete cosine transforms and the discrete Fourier transforms. For the DFT case, literature archives approximations operating at small power-of-two blocklenghts, such as \{8, 16, 32\}, or at large blocklengths, such as 1024, which are obtained by means of the Cooley-Tukey-based approximation relying on the small-blocklength approximate transforms. Cooley-Tukey-based approximations inherit the intermediate multiplications by twiddled factors which are usually not approximated; otherwise the effected error propagation would prevent the overall good performance of the approximation. In this context, the prime factor algorithm can furnish the necessary framework for deriving fully multiplierless DFT approximations. We introduced an approximation method based on small prime-sized DFT approximations which entirely eliminates intermediate multiplication steps and prevents internal error propagation. To demonstrate the proposed method, we design a fully multiplierless 1023-point DFT approximation based on 3-, 11- and 31-point DFT approximations. The performance evaluation according to popular metrics showed that the proposed approximations not only presented a significantly lower arithmetic complexity but also resulted in smaller approximation error measurements when compared to competing methods.

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

↑