首页> 外文会议>Antennas and Propagation (EUCAP), 2012 6th European Conference on >Sparse array synthesis via sequential convex optimizations: Convened session — “Non-uniform array antennas”
【24h】

Sparse array synthesis via sequential convex optimizations: Convened session — “Non-uniform array antennas”

机译:通过顺序凸优化实现的稀疏阵列合成:召开会议—“非均匀阵列天线”

获取原文

摘要

An iterative procedure for the synthesis of sparse arrays radiating focused beampatterns is presented. The algorithm consists in solving a sequence of weighted l1 convex optimization problems. The method can thus be readily implemented and efficiently solved. In the optimization procedure, the objective is the minimization of the number of radiating elements and the constraints correspond to the pattern requirements. The method can be applied to arbitrary arrays which means that there is no restriction regarding the array geometry and individual element patterns to be synthesized. Numerical comparisons with examples found in the literature assess the efficiency of the proposed approach, whose computation time is several orders of magnitude below those of so-called global optimization algorithms.
机译:提出了一种迭代方法,用于合成辐射聚焦束图的稀疏阵列。该算法在于解决一系列加权的l1凸优化问题。该方法因此可以容易地实施并且有效地解决。在优化过程中,目标是使辐射元件的数量最小化,并且约束条件与图案要求相对应。该方法可以应用于任意阵列,这意味着对阵列几何形状和要合成的单个元素图案没有限制。与文献中的示例进行数值比较可评估该方法的效率,该方法的计算时间比所谓的全局优化算法的计算时间低几个数量级。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号