Abstract
An innovative methodology based on joint sparse recovery is proposed for sparse linear array synthesis using a minimum number of elements to generate multiple patterns with different shapes. The synthesis is formulated as a convex problem with the minimization of mixed l 2 /l 1 -norm in terms of the joint sparse recovery in Compressed Sensing. Then convex optimization is properly adopted to solve the above problem efficiently. The proposed method can perform a complete optimization on the number of elements, the common element positions as well as the individual element excitations for all desired patterns simultaneously. Preliminary results are presented to show the effectiveness and flexibility of the proposed method in achieving a sparse linear array including focused, cosec-squared and flat-topped beams.
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.
