Abstract
In this paper we propose a new fast single-pass algorithm for sparse signal recovery by using binary measurement matrices that achieves exact recovery of sparse vectors. This algorithm is therefore superior to algorithms based on l 1 -norm minimization, and methods based on expander graphs (which require multiple iterations and have lower accuracy). Our method is able to exactly recover a sparse signal from a few measurements and the number of measurements is the lowest amongst all methods that use binary measurement matrices.
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.
