{"title":"基于最陡下降算法的频率不变响应阵列设计","authors":"Wang Zhiwei, Wang Dacheng, Liu Wen-shuai","doi":"10.1109/ICINFA.2011.5949049","DOIUrl":null,"url":null,"abstract":"The design of the frequency invariant response array is formulated as an unconstrained optimization problem in this paper. The correlative objective function is presented based on the expression to describe the difference between actual and scheduled spatial response of the array. A new arithmetic is proposed to obtain the frequency invariant weight vectors by applying the steepest-descent algorithm. Computer simulations for uniform linear array and circular array have verified that the new method has high convergence precision and can be applied to arbitrary array without restriction on element patterns.","PeriodicalId":299418,"journal":{"name":"2011 IEEE International Conference on Information and Automation","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Design of frequency invariant response array based on steepest-descent algorithm\",\"authors\":\"Wang Zhiwei, Wang Dacheng, Liu Wen-shuai\",\"doi\":\"10.1109/ICINFA.2011.5949049\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The design of the frequency invariant response array is formulated as an unconstrained optimization problem in this paper. The correlative objective function is presented based on the expression to describe the difference between actual and scheduled spatial response of the array. A new arithmetic is proposed to obtain the frequency invariant weight vectors by applying the steepest-descent algorithm. Computer simulations for uniform linear array and circular array have verified that the new method has high convergence precision and can be applied to arbitrary array without restriction on element patterns.\",\"PeriodicalId\":299418,\"journal\":{\"name\":\"2011 IEEE International Conference on Information and Automation\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-06-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Conference on Information and Automation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICINFA.2011.5949049\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Information and Automation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICINFA.2011.5949049","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Design of frequency invariant response array based on steepest-descent algorithm
The design of the frequency invariant response array is formulated as an unconstrained optimization problem in this paper. The correlative objective function is presented based on the expression to describe the difference between actual and scheduled spatial response of the array. A new arithmetic is proposed to obtain the frequency invariant weight vectors by applying the steepest-descent algorithm. Computer simulations for uniform linear array and circular array have verified that the new method has high convergence precision and can be applied to arbitrary array without restriction on element patterns.