Pattern Synthesis of Subarrayed Large Linear and Planar Arrays Using K-means Solution

In this letter, a new algorithm is presented for synthesizing large linear and planar arrays. To reduce the system cost and implementation complexity, the large array is partitioned into multiple disjoint subarrays and is only weighted at subarray level. By the approximation of the optimization objective, the pattern synthesis problem is first formulated as a weight matching problem. Subsequently,...