{"title":"基于进化算法的跳频信号时频自适应参数化","authors":"Jiantao Guo","doi":"10.1109/CSO.2010.203","DOIUrl":null,"url":null,"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.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Adaptive Time-Frequency Parameterization of Frequency-Hopping Signals Based on Evolutionary Algorithm\",\"authors\":\"Jiantao Guo\",\"doi\":\"10.1109/CSO.2010.203\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":427481,\"journal\":{\"name\":\"2010 Third International Joint Conference on Computational Science and Optimization\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Third International Joint Conference on Computational Science and Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSO.2010.203\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Third International Joint Conference on Computational Science and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSO.2010.203","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Adaptive Time-Frequency Parameterization of Frequency-Hopping Signals Based on Evolutionary Algorithm
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.