{"title":"大型单脉冲阵列合成中计算有效的最优激励匹配","authors":"L. Manica, P. Rocca, A. Martini, A. Massa","doi":"10.1109/APS.2007.4396205","DOIUrl":null,"url":null,"abstract":"This contribution presents an innovative approach based on an optimal excitation matching procedure. By exploiting the relationship between independently-optimal sum and difference patterns, the dimension of the solution space is considerably reduced and efficiently sampled by taking into account the presence of array elements more suitable to change sub-array membership. In the following, the proposed technique is described pointing out, through a representative case, its potentialities and effectiveness in dealing with large arrays.","PeriodicalId":117975,"journal":{"name":"2007 IEEE Antennas and Propagation Society International Symposium","volume":"209 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Computationally-effective optimal excitation matching for the synthesis of large monopulse arrays\",\"authors\":\"L. Manica, P. Rocca, A. Martini, A. Massa\",\"doi\":\"10.1109/APS.2007.4396205\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This contribution presents an innovative approach based on an optimal excitation matching procedure. By exploiting the relationship between independently-optimal sum and difference patterns, the dimension of the solution space is considerably reduced and efficiently sampled by taking into account the presence of array elements more suitable to change sub-array membership. In the following, the proposed technique is described pointing out, through a representative case, its potentialities and effectiveness in dealing with large arrays.\",\"PeriodicalId\":117975,\"journal\":{\"name\":\"2007 IEEE Antennas and Propagation Society International Symposium\",\"volume\":\"209 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE Antennas and Propagation Society International Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APS.2007.4396205\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE Antennas and Propagation Society International Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APS.2007.4396205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Computationally-effective optimal excitation matching for the synthesis of large monopulse arrays
This contribution presents an innovative approach based on an optimal excitation matching procedure. By exploiting the relationship between independently-optimal sum and difference patterns, the dimension of the solution space is considerably reduced and efficiently sampled by taking into account the presence of array elements more suitable to change sub-array membership. In the following, the proposed technique is described pointing out, through a representative case, its potentialities and effectiveness in dealing with large arrays.