Fast algorithm of adaptive Fourier series

DOI10.1002/MMA.4767MaRDI QIDQ4644204zbMATH OpenOpenAlexFDO

Authors You Gao, Min Ku, Tao Qian

Publication date 30 May 2018

Published in Mathematical Methods in the Applied Sciences (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1711.08604

zbMATH Keywords

adaptive decompositionanalytic signalscomputational complexityHilbert space

Mathematics Subject Classification ID

Other generalizations of function theory of one complex variable (32A30) (H^p)-spaces, Nevanlinna spaces of functions in several complex variables (32A35) Conjugate functions, conjugate series, singular integrals (42A50) Banach algebras of differentiable or analytic functions, (H^p)-spaces (46J15) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: 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 $mathcalO(M{N}^2)$ to $mathcalO(MNlo{g}_{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.

Recommendations

• Adaptive Fourier series---a variation of greedy algorithm
• Algorithm of Adaptive Fourier Decomposition
• scientific article; zbMATH DE number 1217618
• Computation of adaptive Fourier series by sparse approximation of exponential sums
• A fast algorithm for Fourier continuation
• scientific article; zbMATH DE number 698682
• scientific article; zbMATH DE number 800793
• Rapid function approximation by modified Fourier series
• FFT formulations of adaptive Fourier decomposition
• scientific article; zbMATH DE number 3907734

Cited in

(10)

• Computation of adaptive Fourier series by sparse approximation of exponential sums
• The AFD methods to compute Hilbert transform
• FFT formulations of adaptive Fourier decomposition
• Adaptive Fourier series---a variation of greedy algorithm
• Greedy adaptive decomposition of signals based on nonlinear Fourier atoms
• A novel signal decomposition approach -- adaptive Fourier decomposition
• Two-dimensional adaptive Fourier decomposition
• Algorithm of adaptive Fourier decomposition in H2(ℂ+)
• Adaptive Fourier decompositions and rational approximations. I: Theory
• Adaptive Fourier decomposition and rational approximation. II: Software system design and development

This page was built for publication: Fast algorithm of adaptive Fourier series

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4644204)