A new approach to the power synthesis of fixed-geometry reconfigurable planar arrays radiating sum and difference patterns is presented. The proposed design technique allows to maximize the radiation performance (field slope, amplitude, or even directivity) of both beam patterns over assigned directions subject to completely arbitrary masks for sidelobe bounds. Whatever the elements disposal and the array boundary, the overall problem is solved through a convex (quadratic) programming procedure. Moreover, if centrosymmetric antenna layouts are adopted, the synthesis is reduced to an even more powerful linear programming routine which preserves the solution uniqueness and optimality guaranteed by quadratic programming codes while dramatically decreasing their computational weight (and hence enabling the design of much larger planar arrays). The proposed approach also takes into account the need of reducing the complexity of the beam forming network (BFN), which is fulfilled by sharing part of the excitation amplitudes between the two radiation modalities. A set of numerical examples is reported and discussed to show the versatility and effectiveness of the proposed approach.
Optimal Synthesis of Reconfigurable Planar Arrays With Simplified Architectures for Monopulse Radar Applications / Rocca, P.; Morabito, A. F.. - In: IEEE TRANSACTIONS ON ANTENNAS AND PROPAGATION. - ISSN 0018-926X. - 63:3(2015), pp. 6998934.1048-6998934.1058. [10.1109/TAP.2014.2386359]
Optimal Synthesis of Reconfigurable Planar Arrays With Simplified Architectures for Monopulse Radar Applications
A. F. Morabito
2015-01-01
Abstract
A new approach to the power synthesis of fixed-geometry reconfigurable planar arrays radiating sum and difference patterns is presented. The proposed design technique allows to maximize the radiation performance (field slope, amplitude, or even directivity) of both beam patterns over assigned directions subject to completely arbitrary masks for sidelobe bounds. Whatever the elements disposal and the array boundary, the overall problem is solved through a convex (quadratic) programming procedure. Moreover, if centrosymmetric antenna layouts are adopted, the synthesis is reduced to an even more powerful linear programming routine which preserves the solution uniqueness and optimality guaranteed by quadratic programming codes while dramatically decreasing their computational weight (and hence enabling the design of much larger planar arrays). The proposed approach also takes into account the need of reducing the complexity of the beam forming network (BFN), which is fulfilled by sharing part of the excitation amplitudes between the two radiation modalities. A set of numerical examples is reported and discussed to show the versatility and effectiveness of the proposed approach.File | Dimensione | Formato | |
---|---|---|---|
MORABITO_2015_TAP_RADAR_EDITOR.pdf
non disponibili
Descrizione: versione editoriale - SOLO GESTORI ARCHIVIO
Tipologia:
Versione Editoriale (PDF)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
2.6 MB
Formato
Adobe PDF
|
2.6 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
MORABITO_2015_TAP_RADAR_POST.pdf
accesso aperto
Descrizione: POST-PRINT DELL'AUTORE
Tipologia:
Documento in Post-print
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
2.7 MB
Formato
Adobe PDF
|
2.7 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.