arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1711.08604math.NAcs.NAmath.CV
收藏

自适应傅里叶级数的快速算法

Fast algorithm of adaptive Fourier series

School of Mathematics (Zhuhai), Sun Yat-Sen University(中山大学数学学院(珠海));CIDMA, Department of Mathematics, University of Aveiro(阿威罗大学数学系);Department of Mathematics, University of Macau(澳门大学数学系)

You Gao, Min Ku, Tao Qian

AI总结:

本文提出一种将FFT算法融入1-D AFD的快速自适应傅里叶分解方法,将复杂度从O(MN²)降至O(MNlog₂N),显著提升了AFD的应用性,并通过实验验证了其高效性。

摘要:

自适应傅里叶分解(AFD,即1-D AFD或核心AFD)最初旨在实现信号的正频率表示。它实现了这一目标,同时提供了快速的信号分解。随后出现了几种类型的AFD。AFD结合了贪心算法思想,特别是启发了所谓的预正交贪心算法(Pre-OGA),该算法被证明是最有效的贪心算法。然而,AFD类型分解的缺点是由于字典参数的最大选择导致的高计算复杂性。本文通过将FFT算法融入1-D AFD中,提出了一种1-D AFD算法的公式化方法。因此,算法复杂度从原来的O(MN²)降低到O(MNlog₂N),其中N表示单位圆上离散点的数量,M表示[0,1)区间内的点数。这大大提高了AFD的应用性。通过实验验证了所提出算法的高效性。

英文摘要:

Adaptive Fourier decomposition (AFD, precisely 1-D AFD or Core-AFD) was originated for the goal of positive frequency representations of signals. It achieved the goal and at the same time offered fast decompositions of signals. There then arose several types of AFDs. AFD merged with the greedy algorithm idea, and in particular, motivated the so-called pre-orthogonal greedy algorithm (Pre-OGA) that was proven to be the most efficient greedy algorithm. The cost of the advantages of the AFD type decompositions is, however, the high computational complexity due to the involvement of maximal selections of the dictionary parameters. The present paper offers one formulation of the 1-D AFD algorithm by building the FFT algorithm into it. Accordingly, the algorithm complexity is reduced, from the original $\mathcal{O}(M N^2)$ to $\mathcal{O}(M N\log_2 N)$, where $N$ denotes the number of the discretization points on the unit circle and $M$ denotes the number of points in $[0,1)$. This greatly enhances the applicability of AFD. Experiments are carried out to show the high efficiency of the proposed algorithm.

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

↑