Abstract
In this letter, a novel pattern synthesis algorithm that jointly optimizes the number, positions, and excitation of elements in a sparse linear array (SLA) is designed based on continuous compressed sensing. The pattern synthesis problem is first formulated as a sparse recovery problem, which can be solved using semidefinite programming involving atomic norm minimization (ANM). The parameters of the designed SLA, including the corresponding element positions and excitations, are determined via Vandermonde decomposition and least squares in the continuous domain. As ANM works directly in the continuous domain, the proposed algorithm is able to synthesize the desired patterns with a small mismatch and a small number of elements. A number of representative numerical experiments show the effectiveness of our algorithm.
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.
