Izvorni znanstveni članak

Some Facts and Challenges in Array Antenna Synthesis Problems

Ovidio Mario Bucci
Michele D’Urso
Tommaso Isernia

Sažetak

Many efforts have been done in recent years to solve array synthesis problems in a way as effective as possible. Stochastic optimization schemes have been widely applied to this end, notwithstanding their performance rapidly lowers as the size of the problem increases. This trend has led to neglect mathematical properties of the problem, as convexity or partial convexity, which may be very useful to devise really effective synthesis procedures. In this paper we show that in a number of array synthesis problems of significant practical interest global optimisation is not required at all, or can be limited to a subset of the unknowns. This is by no means an academic point, as we show that a proper exploitation of the convexity allows to achieve, in a much shorter time, design solutions significantly better than those obtained by using general purpose global optimization techniques.

Ključne riječi

Convex Optimisation; Array Synthesis

Hrčak ID:

25743

URI

https://hrcak.srce.hr/25743

Datum izdavanja:

15.5.2008.

Podaci na drugim jezicima: hrvatski

Posjeta: 1.462 *