针对运用凸优化方法综合平面阵列耗时较长的问题，提出一种基于凸优化的低复杂度平面阵列综合方法。该方法将基于加权ℓ1范数最小化的平面阵列综合模型中二维波束旁瓣约束条件转换成横向阵列和纵向阵列的一维波束旁瓣约束问题，从而降低了凸优化的约束条件数，有效加快了算法的收敛速度。仿真结果表明，该方法虽然在平面阵列综合的稀疏程度方面要稍劣于传统凸优化方法，但是它能快速获得具有大范围低波束旁瓣电平以及更短孔径的平面阵列。%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.
展开▼
