Signal component extraction method based on polynomial chirp Fourier transform

Author:

Lu Wen-Long ,Xie Jun-Wei ,Wang He-Ming ,Sheng Chuan ,

Abstract

As frequency modulated (FM) signals widely exist in the natural world as well as in different artificial applications, it is of great practical significance to explore the ways to extract such signal components in the complex and noisy environment. To extract one component from the noisy multicomponent signal effectively, a component extraction method based on polynomial chirp Fourier transform (PCFT) is presented in this paper. First, the physical meanings of Fourier transform (FT) and fractional Fourier transform (FRFT) are analyzed and their internal relations are expounded from the perspective of signal energy accumulation. Essentially, the FT accumulates signal energy along the time-frequency beelines parallel to the time axis and obtains an energy-concentrated spectrum from the narrow-band stationary signals whose frequency does not change, whereas it fails to process non-stationary signals with changeable frequencies. By rotating the time-frequency axis, the FRFT changes the energy accumulation mode of the signal in the old time-frequency plane and achieves a more concentrated spectrum for the linear frequency modulated (LFM) signal, but with larger error or even invalidation when dealing with nonlinear frequency modulated (NLFM) signal. Using FT and FRFT, in this paper we attempt to improve the energy accumulation mode of the conventional transform method and propose the PCFT. In this transform, the beeline families in the traditional transform, independent of time (or v) axes, are replaced by a family of polynomial chirping curves in the time-frequency plane. These polynomial chirping curves are capable of approaching more closely to the instantaneous frequency curve of FM signal so as to obtain a more concentrated transform spectrum and thereby extend the application of PCFT from LFM signal to NLFM signal. When selecting the polynomial chirping curve, we build up a nonlinear optimization model guided by the principle of energy spectrum concentration and in this way convert the problem of determining the polynomial curve families into the one of optimizing the polynomial parameters. Then particle swarm optimization algorithm is employed to search for the optimal polynomial parameters so as to concentrate the energy of one component in the new transform domain, i.e., the polynomial chirp Fourier domain. After doing that, each component is separated into its concentrated spectrum with a narrow-band filter and reconstructed with the inverse PCFT. Moreover, to extract components from a noisy multicomponent signal successfully, an iteration involving parameter estimation, PCFT, filter and recovery is introduced. To verify the effectiveness of the PCFT-based method, a series of examples, including simulated and real-world signals, is chosen for simulations and experiments. The experimental results indicate that compared with FT and FRFT, the proposed method overcomes the shortcoming of distributed energy spectrum for NLFM components in the traditional transforms and obtains a concentrated energy spectrum in the polynomial chirp Fourier domain, therefore realizing component separation and time-frequency characteristic extraction. The PCFT-based method not only has the capability of dealing with the extraction of LFM components, but also performs well in the separation of crossed NLFM components, and with little extraction error.

Publisher

Acta Physica Sinica, Chinese Physical Society and Institute of Physics, Chinese Academy of Sciences

Subject

General Physics and Astronomy

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3