Synthesis of Subarrayed Linear Arrays via K-means Method

This paper proposes a new array synthesis method for large linear arrays. Traditional large arrays usually have some challenges, such as high cost and complex feeding networks. Partitioning the large array into disjoint subarrays can effectively reduce these problems. In this paper, the K-means method and the convex optimization method are combined to effectively solve the above problems. Compared to other methods, the proposed method can obtain lower sidelobe level.