An innovative synthesis procedure to design sub-arrayed antennas affording multiple patterns is presented in this paper. The approach is based on an excitation matching procedure aimed at generating one optimal pattern and multiple compromises close as much as possible to user-defined reference beams. A suitable modification of the -means clustering algorithm integrated into a customized version of the contiguous partition method is used to efficiently sample the solution space looking for the best compromise excitations. A set of representative numerical results is reported to give some indications on the reliability, potentialities, and limitations of the proposed approach.
Synthesis of multi-beam sub-arrayed antennas through an excitation matching strategy
Manica, Luca;Rocca, Paolo;Oliveri, Giacomo;Massa, Andrea
2011-01-01
Abstract
An innovative synthesis procedure to design sub-arrayed antennas affording multiple patterns is presented in this paper. The approach is based on an excitation matching procedure aimed at generating one optimal pattern and multiple compromises close as much as possible to user-defined reference beams. A suitable modification of the -means clustering algorithm integrated into a customized version of the contiguous partition method is used to efficiently sample the solution space looking for the best compromise excitations. A set of representative numerical results is reported to give some indications on the reliability, potentialities, and limitations of the proposed approach.File | Dimensione | Formato | |
---|---|---|---|
Synthesis of multi-beam sub-arrayed antennas through an excitation matching strategy.pdf
Solo gestori archivio
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
1.4 MB
Formato
Adobe PDF
|
1.4 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione