电讯技术Issue(12)：1318-1323,6.DOI:10.3969/j.issn.1001-893x.2015.12.002
一种平面稀疏阵列的快速综合方法
A Fast Synthesis Method for Planar Sparse Array
摘要
Abstract
In order to fast synthesize the planar array to satisfy the desired pattern and minimize the number of radiating elements,a planar array synthesis method based on iteratively reweighted l1 norm minimization is proposed. The problem of planar array synthesis is transformed into a process of the sparse signal recon-struction based on reweighted l1 norm minimization,and the closed-form solution of the array weight vector at each iteration is obtained by the Lagrange multiplier method. Due to the inverse operation of the large-scale matrix caused by the two dimensional spatial sampling in the closed-form solution,the conjugate Gra-dient method is introduced to promote the convergence speed of the proposed method. The excitations and locations of sensors in the planar sparse array are determined by the nonzero elements in the solved weight vector until the iteration termination condition is satisfied. Simulation results show that the proposed meth-od can effectively speed up the planar sparse array synthesis.关键词
平面稀疏阵列/阵列综合/加权l1 范数/闭式解/共轭梯度Key words
plannar sparse array/array synthesis/weighted l1 norm/closed-form solution/conjugate gradient分类
信息技术与安全科学引用本文复制引用
陈金立,张涛,曹华松,李家强..一种平面稀疏阵列的快速综合方法[J].电讯技术,2015,(12):1318-1323,6.基金项目
国家自然科学基金资助项目(61302188,61372066) （61302188,61372066）
江苏省自然科学基金资助项目(BK20131005)Foundation Item:The National Natural Science Foundation of China(No.61302188,61372066) （BK20131005）
The Natural Science Foundation of Jiangsu Province(BK20131005) （BK20131005）
