Abstract
Bounding the sidelobe and mainlobe levels of an array with complex weights is attractive in that it allows direct control of the radiation pattern. In this paper we propose an efficient beamforming technique for synthesizing the patterns of large arrays with bound constraints on the sidelobe and mainlobe levels. It is shown that the pattern synthesis problem can be posed as a convex semi-infinite programme (SIP) which is then turned into a semidefinite programme (SDP) via a novel linear matrix inequality (LMI) characterization of semi-infinite trigonometric polynomial constraints. In contrast to existing SDP formulations which require a large number of additional variables, our SDP representation only uses a minimal number of additional variables. This subsequently enables the design of patterns for arrays with several hundred elements to be efficiently achieved on a standard personal computer using existing SDP solvers
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
