Abstract

A simple procedure for the synthesis of shaped beams with arbitrary arrays is presented. The steps that reduce this general synthesis problem to a linear programming one, which is then called iteratively, are detailed. Since linear program solvers are largely and freely available, the additional effort to solve the shaping beam synthesis problem is limited. Numerical applications and comparisons to results found in the literature are performed to show the efficiency of the proposed procedure. To illustrate its versatility, the shaped-beam pattern synthesis is also presented for a conformal array.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call