In this letter, the synthesis of large arrays for monopulse tracking applications is addressed by means of a simple and effective subarraying technique. Towards this purpose, the synthesis problem is recast as the search of an optimal path in a noncomplete binary tree by exploiting some relationships between independently optimal sum and difference excitations. Because of a suitable reduction of the solution space and the implementation of a fast path-searching algorithm, the computational issues arising in dealing with large array aperture are properly addressed. Some numerical experiments are provided in order to assess the feasibility and the computational effectiveness of the tree-based approach. (c) 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.

Synthesis of Large Monopulse Linear Arrays Though a Tree-Based Optimal Excitations Matching / Manica, Luca; Martini, Anna; Rocca, Paolo; Massa, Andrea. - ELETTRONICO. - (2007), pp. 1-20.

Synthesis of Large Monopulse Linear Arrays Though a Tree-Based Optimal Excitations Matching

Manica, Luca;Martini, Anna;Rocca, Paolo;Massa, Andrea
2007-01-01

Abstract

In this letter, the synthesis of large arrays for monopulse tracking applications is addressed by means of a simple and effective subarraying technique. Towards this purpose, the synthesis problem is recast as the search of an optimal path in a noncomplete binary tree by exploiting some relationships between independently optimal sum and difference excitations. Because of a suitable reduction of the solution space and the implementation of a fast path-searching algorithm, the computational issues arising in dealing with large array aperture are properly addressed. Some numerical experiments are provided in order to assess the feasibility and the computational effectiveness of the tree-based approach. (c) 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
2007
Trento
University of Trento - Dipartimento di Ingegneria e Scienza dell'Informazione
Synthesis of Large Monopulse Linear Arrays Though a Tree-Based Optimal Excitations Matching / Manica, Luca; Martini, Anna; Rocca, Paolo; Massa, Andrea. - ELETTRONICO. - (2007), pp. 1-20.
Manica, Luca; Martini, Anna; Rocca, Paolo; Massa, Andrea
File in questo prodotto:
File Dimensione Formato  
DISI-11-059.pdf

accesso aperto

Tipologia: Versione editoriale (Publisher’s layout)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 371.35 kB
Formato Adobe PDF
371.35 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11572/358213
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact