• DocumentCode
    524679
  • Title

    Adaptive Time-Frequency Parameterization of Frequency-Hopping Signals Based on Evolutionary Algorithm

  • Author

    Guo, Jiantao

  • Author_Institution
    Coll. of Phys. & Electron. Eng., Xinyang Normal Univ., Xinyang, China
  • Volume
    1
  • fYear
    2010
  • fDate
    28-31 May 2010
  • Firstpage
    279
  • Lastpage
    282
  • Abstract
    Matching pursuit algorithm extracting the time-frequency characteristics of signal has been applied in many fields. High computer complexity is a bottle-neck, especially in the high dimensions of the search space. In this paper, genetic algorithm and particle swarm optimization is used to solve this problem. Two decomposition methods named particle swarm optimization matching pursuit (PSO-MP) and genetic algorithm matching pursuit (GA-MP) are proposed for time-frequency analysis of frequency hopping signals. Experiment results proved the validity and feasibility of the approaches. Compared to GA-MP algorithm, PSO-MP algorithm could choose more precise atom parameters and has higher convergent speed as to the average process time.
  • Keywords
    computational complexity; frequency hop communication; genetic algorithms; particle swarm optimisation; GA-MP algorithm; PSO-MP algorithm; adaptive time-frequency parameterization; evolutionary algorithm; frequency-hopping signals; genetic algorithm; high computer complexity; matching pursuit algorithm; particle swarm optimization matching pursuit; time-frequency characteristics; Dictionaries; Evolutionary computation; Genetic algorithms; Iterative algorithms; Matching pursuit algorithms; Particle swarm optimization; Pursuit algorithms; Signal analysis; Signal processing; Time frequency analysis; frequency hopping signal; matching pursuit; particle swarm optimization; time frequency analysis;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Science and Optimization (CSO), 2010 Third International Joint Conference on
  • Conference_Location
    Huangshan, Anhui
  • Print_ISBN
    978-1-4244-6812-6
  • Electronic_ISBN
    978-1-4244-6813-3
  • Type

    conf

  • DOI
    10.1109/CSO.2010.203
  • Filename
    5533158