Abstract
We analyze the performance of several algorithms designed to solve the inverse sparse problem when they are applied to array signal processing. Specifically we study the error on the estimation of the complex envelope and the direction of arrival of signals of interest in the presence of interference sources using a uniform linear array. In particular, we compare the performance of the Enhanced Sparse Bayesian Learning (ESBL) algorithm against different algorithms tailored to this scenario. Since the former exploits interference information to diminish its unwanted effects, we find that it provides a reasonable tradeoff between runtime and estimation error.
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.
