UM  > 科技學院  > 數學系
Fast algorithm of adaptive Fourier series
Gao, You1; Ku, Min2; Qian, Tao3
2018-05-15
Source PublicationMATHEMATICAL METHODS IN THE APPLIED SCIENCES
ISSN0170-4214
Volume41Issue:7Pages:2654-2663
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. The 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 constructs one novel method to perform the 1-D AFD algorithm. We make use of the FFT algorithm to reduce the algorithm complexity, from the original O(MN2) to O(MNN), 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 performed to show the high efficiency of the proposed algorithm.

KeywordAdaptive Decomposition Analytic Signals Computational Complexity Hilbert Space
DOIhttp://doi.org/10.1002/mma.4767
URLView the original
Indexed BySCI
Language英语
WOS Research AreaMathematics
WOS SubjectMathematics, Applied
WOS IDWOS:000429005600009
PublisherWILEY
The Source to ArticleWOS
Fulltext Access
Citation statistics
Document TypeJournal article
CollectionDEPARTMENT OF MATHEMATICS
Corresponding AuthorKu, Min
Affiliation1.School of Mathematics (Zhuhai), SunYat-Sen University, Zhuhai, China
2.Department of Computing Science,University of Radboud, 6525 ECNijmegen, Netherlands
3.Department of Mathematics, Universityof Macau, Macao (Via Hong Kong), China
Recommended Citation
GB/T 7714
Gao, You,Ku, Min,Qian, Tao. Fast algorithm of adaptive Fourier series[J]. MATHEMATICAL METHODS IN THE APPLIED SCIENCES,2018,41(7):2654-2663.
APA Gao, You,Ku, Min,&Qian, Tao.(2018).Fast algorithm of adaptive Fourier series.MATHEMATICAL METHODS IN THE APPLIED SCIENCES,41(7),2654-2663.
MLA Gao, You,et al."Fast algorithm of adaptive Fourier series".MATHEMATICAL METHODS IN THE APPLIED SCIENCES 41.7(2018):2654-2663.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Gao, You]'s Articles
[Ku, Min]'s Articles
[Qian, Tao]'s Articles
Baidu academic
Similar articles in Baidu academic
[Gao, You]'s Articles
[Ku, Min]'s Articles
[Qian, Tao]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Gao, You]'s Articles
[Ku, Min]'s Articles
[Qian, Tao]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.