Abstract
In compressive sensing, the generalised orthogonal matching pursuit (gOMP) algorithm is one kind of sparse signal recovery algorithm, which generalises the OMP algorithm by selecting a fixed number of atoms at each iteration. Restricted isometry constant-based sufficient conditions to guarantee the correct support identification and the successful recovery of a sparse signal using the gOMP algorithm in a noiseless case are proposed. The proposed sufficient bounds are more relaxed compared with the existing ones.
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.
