Linear and Planar Array Pattern Nulling via Compressed Sensing

Abstract

An optimization method based on compressed sensing is proposed for uniformly excited linear or planar antenna arrays to perturb excitation of the minimum number of array elements in such a way that the required number of nulls is obtained. First, the spares theory is relied upon to formulate the problem and then the convex optimization approach is adopted to find the optimum solution. The optimization process is further developed by using iterative re-weighted l1norm minimization, helping select the least number of the sparse elements and impose the required constraints on the array radiation pattern. Furthermore, the nulls generated are wide enough to cancel a whole specific sidelobe. Simulation results demonstrate the effectiveness of the proposed method and the required nulls are placed with a minimum number of perturbed elements. Thus, in practical implementations of the proposed method, a highly limited number of attenuators and phase shifters is required compared to other, conventional methods. Keywords—compressed sensing, convex optimization, iterative re-weighted l1norm minimization, linear and planar arrays.