现代电子技术Issue(3)：9-12,4.DOI:10.16652/j.issn.1004-373x.2016.03.003
基于凸优化的低复杂度平面阵列综合方法
Low complexity planar array synthesis method based on convex optimization
摘要
Abstract
Since the convex optimization method used to synthesize the planar array has long time consuming,a low com⁃plexity planar array synthesis method based on convex optimization is proposed. The two⁃dimensional beam sidelobe constraint condition in the planar array synthesis model based on weighted ℓ1 norm minimization is transformed into the one⁃dimensional beam sidelobe constraint condition for horizontal array and longitudinal array by the method,which can reduce the number of convex optimization constraint conditions,and effectively promote the convergence speed of the algorithm. The simulation results show that the proposed method performs slightly worse than the traditional convex optimization method in the aspect of sparsity degree of synthesis planar array,but it can fast obtain the planar array with shorter aperture and broader low⁃beam sidelobe level.关键词
平面阵列/阵列综合/凸优化/低复杂度Key words
planar array/array synthesis/convex optimization/low complexity分类
信息技术与安全科学引用本文复制引用
陈金立,钟济阳,曹华松..基于凸优化的低复杂度平面阵列综合方法[J].现代电子技术,2016,(3):9-12,4.基金项目
国家自然科学基金（61302188，61372066）；江苏省自然科学基金 （）
