UM  > 科技學院  > 數學系
Greedy adaptive decomposition of signals based on nonlinear Fourier atoms
Kou K.I.1; Li H.2
2016-05-01
Source PublicationInternational Journal of Wavelets, Multiresolution and Information Processing
ISSN02196913
Volume14Issue:3
Abstract

This paper aims at adaptive decomposition of signals in terms of nonlinear Fourier atoms. Each nonlinear Fourier atom is analytic and mono-component. The algorithm is considered as an adaptive greedy procedure based on nonlinear Fourier atoms. The convergence results for the proposed algorithms show that it is suitable to approximate a signal by a linear combinations of nonlinear Fourier atoms. Experiments are presented to illustrate the proposed algorithm and theory.

KeywordAnalytic Signal Approximation Greedy Algorithm Nonlinear Fourier Atom
DOI10.1142/S0219691316500144
URLView the original
Indexed BySCI
Language英语
WOS Research AreaComputer Science ; Mathematics
WOS SubjectComputer Science, Software Engineering ; Mathematics, Interdisciplinary Applications
WOS IDWOS:000378541200007
全文获取链接
引用统计
Document TypeJournal article
专题DEPARTMENT OF MATHEMATICS
Affiliation1.Universidade de Macau
2.Huazhong University of Science and Technology
推荐引用方式
GB/T 7714
Kou K.I.,Li H.. Greedy adaptive decomposition of signals based on nonlinear Fourier atoms[J]. International Journal of Wavelets, Multiresolution and Information Processing,2016,14(3).
APA Kou K.I.,&Li H..(2016).Greedy adaptive decomposition of signals based on nonlinear Fourier atoms.International Journal of Wavelets, Multiresolution and Information Processing,14(3).
MLA Kou K.I.,et al."Greedy adaptive decomposition of signals based on nonlinear Fourier atoms".International Journal of Wavelets, Multiresolution and Information Processing 14.3(2016).
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
Google Scholar
中相似的文章 Google Scholar
[Kou K.I.]的文章
[Li H.]的文章
Baidu academic
中相似的文章 Baidu academic
[Kou K.I.]的文章
[Li H.]的文章
Bing Scholar
中相似的文章 Bing Scholar
[Kou K.I.]的文章
[Li H.]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。