This paper presents a novel pattern matching-based methodology for the synthesis of subarrayed linear antenna arrays. A multi-step procedure that combines the k-means algorithm for defining the array partitions and the iterative projection method to find the best subarray excitations is proposed. A representative numerical result is discussed in order to highlight the improvements with respect to the state-of-the-art excitation matching-based approach.
Pattern Matching Approach for the Synthesis of Sub-Arrayed Linear Antenna Arrays / Benoni, A.; Poli, L.. - STAMPA. - (2022), pp. 1620-1621. (Intervento presentato al convegno 2022 IEEE International Symposium on Antennas and Propagation and USNC-URSI Radio Science Meeting (AP-S/URSI) tenutosi a Denver, Colorado, USA nel 10 - 15 July 2022) [10.1109/AP-S/USNC-URSI47032.2022.9886904].
Pattern Matching Approach for the Synthesis of Sub-Arrayed Linear Antenna Arrays
Benoni A.;Poli L.
2022-01-01
Abstract
This paper presents a novel pattern matching-based methodology for the synthesis of subarrayed linear antenna arrays. A multi-step procedure that combines the k-means algorithm for defining the array partitions and the iterative projection method to find the best subarray excitations is proposed. A representative numerical result is discussed in order to highlight the improvements with respect to the state-of-the-art excitation matching-based approach.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione
