Improved Algorithm X for Subarray Partition With Acceleration and Sidelobe Suppression

Subarray is widely used in array antennas to decrease the system complexity, which would also increase the sidelobes during scanning. To solve this problem, subarray partition solutions with larger coverage and lower sidelobes are selected from a series of results generated by search algorithms. However, searching for an appropriate result of a large array is time-consuming. In this study, to search subarray solutions of full coverage with less time, we introduce two pruning processes in Algorithm X. Additionally, a pair of coefficients associated with the sidelobes is adopted for further pruning and reducing the sidelobes. Numerical experiments have been carried out and verified the effectiveness and the performance of the proposed method.