Antenna selection in the synthesis of mutlple-pattern linear arrays by iterative linear programming

The problem of selecting antennas for synthesizing multiple-pattern linear arrays is considered. It is shown that this problem can be solved by an iterative linear programming procedure. Only few iterations are required for this procedure to reach the convergence. The synthesis results show that the proposed method can select the optimum element positions and consequently reduces the number of elements, while the synthesized multiple patterns can meet the specified multiple pattern bounds.