Daniel Depărăţeanu, F. Enache, Andrei Enache, F. Popescu, I. Nicolaescu
{"title":"基于遗传算法的稀疏阵列天线优化","authors":"Daniel Depărăţeanu, F. Enache, Andrei Enache, F. Popescu, I. Nicolaescu","doi":"10.1109/ECAI.2016.7861100","DOIUrl":null,"url":null,"abstract":"The aim of sparse array antenna synthesis is to obtain a desired radiation pattern with a minimum number of antenna elements. In this paper, the antenna synthesis problem is approached in a different manner. Starting from a uniform linear antenna array radiation pattern, the maximum number of elements that can be removed, while maintaining a desired radiation pattern, is determined using genetic algorithms optimization. Parameters such as beamwidth and sidelobe levels are evaluated for different types of sparse array antennas and are compared with those obtained for a uniformly spaced antenna array. Numerical examples are presented to show the high efficiency of the proposed method.","PeriodicalId":122809,"journal":{"name":"2016 8th International Conference on Electronics, Computers and Artificial Intelligence (ECAI)","volume":"35 11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Sparse array antenna optimization using genetic alghoritms\",\"authors\":\"Daniel Depărăţeanu, F. Enache, Andrei Enache, F. Popescu, I. Nicolaescu\",\"doi\":\"10.1109/ECAI.2016.7861100\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The aim of sparse array antenna synthesis is to obtain a desired radiation pattern with a minimum number of antenna elements. In this paper, the antenna synthesis problem is approached in a different manner. Starting from a uniform linear antenna array radiation pattern, the maximum number of elements that can be removed, while maintaining a desired radiation pattern, is determined using genetic algorithms optimization. Parameters such as beamwidth and sidelobe levels are evaluated for different types of sparse array antennas and are compared with those obtained for a uniformly spaced antenna array. Numerical examples are presented to show the high efficiency of the proposed method.\",\"PeriodicalId\":122809,\"journal\":{\"name\":\"2016 8th International Conference on Electronics, Computers and Artificial Intelligence (ECAI)\",\"volume\":\"35 11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 8th International Conference on Electronics, Computers and Artificial Intelligence (ECAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ECAI.2016.7861100\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 8th International Conference on Electronics, Computers and Artificial Intelligence (ECAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECAI.2016.7861100","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Sparse array antenna optimization using genetic alghoritms
The aim of sparse array antenna synthesis is to obtain a desired radiation pattern with a minimum number of antenna elements. In this paper, the antenna synthesis problem is approached in a different manner. Starting from a uniform linear antenna array radiation pattern, the maximum number of elements that can be removed, while maintaining a desired radiation pattern, is determined using genetic algorithms optimization. Parameters such as beamwidth and sidelobe levels are evaluated for different types of sparse array antennas and are compared with those obtained for a uniformly spaced antenna array. Numerical examples are presented to show the high efficiency of the proposed method.