Hybrid optimisation algorithm and its application for pattern synthesis of planar arrays

Abstract

A hybrid approach to the synthesis of sparse arrays radiating shaped or focused beampattern is presented in this paper. Specifically, an iterative scheme is used where the prescribed pattern response in the mainlobe peak direction is cast as a multi-convex problem at each step that the non-convex lower bound constraint is relaxed while including a reweighted l(1)-norm minimisation based on the magnitudes of the elements. Numerical tests, referred to benchmark problems, show that the proposed method achieves improved radiation performance by using fewer number of radiating elements.

Keywords

• minimisation
• iterative methods
• antenna radiation patterns
• planar antenna arrays
• convex programming
• hybrid optimisation algorithm
• pattern synthesis
• hybrid approach
• sparse arrays
• beampattern
• iterative scheme
• mainlobe peak direction
• multiconvex problem
• nonconvex lower bound constraint
• numerical tests
• benchmark problems
• radiation performance
• radiating elements
• pattern response
• planar atenna arrays
• reweighted l(1)-norm minimisation