Abstract
In this paper, the design of sparse planar arrays is yielded through a set of innovative and efficient pattern matching algorithms within the Bayesian Compressive Sensing (BCS) framework. Towards this end, the 2D sparse synthesis problem is formulated in a probabilistic fashion and the single-task (ST) and the multi-task (MT) BCS solutions are derived. The results from a numerical validation concerned with different aperture size and target patterns prove that the proposed implementations enable an element saving ranging from 25% up to 87%, while achieving a reliable beam control.
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.
