Abstract
The problem of synthesising a sparse linear array with multiple patterns is formulated as an extended reweighted l 1 -norm minimisation with multiple convex constraints. Synthesis results show that the proposed method can find the common sparse element positions with optimised excitations for multiple-pattern requirements, and the mainlobe, sidelobe as well as nulling region for each pattern can be accurately controlled.
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.
