Abstract

A novel method called alternating convex optimization is presented to synthesize unequally spaced linear arrays with minimum element spacing constraint. In this method, the problem of synthesizing an unequally spaced array is formulated as a sequence of alternating convex optimization problems, and the excitation vector and auxiliary weighting vector are alternately chosen as the optimization variables. The minimum spacing constraint for considering the physical element antenna size can be easily imposed in this alternating optimization process. Two examples for synthesizing unequally spaced linear arrays with focused and shaped patterns are provided to validate the effectiveness and advantages of the proposed method.

Full Text
Paper version not known

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.