The synthesis of compromise sum and difference patterns of large planar arrays is addressed in this letter by means of a suitable implementation of the Contiguous Partition Method (CPM). By exploiting some properties of the solution space, the generation of compromise sum-difference patterns is recast as the searching of the optimal path in a graph that codes the admissible solution space. Some numerical experiments are provided in order to assess the effectiveness of the proposed method.

On the synthesis of sub-arrayed planar array antennas for tracking radar applications

Manica, Luca;Rocca, Paolo;Massa, Andrea
2008-01-01

Abstract

The synthesis of compromise sum and difference patterns of large planar arrays is addressed in this letter by means of a suitable implementation of the Contiguous Partition Method (CPM). By exploiting some properties of the solution space, the generation of compromise sum-difference patterns is recast as the searching of the optimal path in a graph that codes the admissible solution space. Some numerical experiments are provided in order to assess the effectiveness of the proposed method.
2008
Manica, Luca; Rocca, Paolo; Massa, Andrea
File in questo prodotto:
Non ci sono file associati a questo prodotto.

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/78957
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 25
  • ???jsp.display-item.citation.isi??? 14
  • OpenAlex ND
social impact