Abstract
For recovering the block-sparse signal with unknown block structures, this paper presents a Block Stage-wise Weak Orthogonal Matching Pursuit (BSWOMP) algorithm. Which partitions the original signal into different groups or segments and conducts the selection for these groups separately using weak selection method to update reconstructing support set. And it proves that the Restricted Isometry Property (RIP) of BSWOMP algorithm is slack than Stage-wise Weak Orthogonal Matching Pursuit (SWOMP) algorithm and Block Orthogonal Matching Pursuit (BOMP) algorithm, this means BSWOMP algorithm generates better convergence than traditional sparse signal recovery algorithm. To further analysis of the performance of BSWOMP, the effectiveness of this algorithm is demonstrated by simulations. Experiments results show that the proposed algorithm effectively selects the nonzero elements of the block-sparse signal by a threshold, and compared with the traditional algorithms, BSWOMP algorithm has higher recovering stability, expedites the approximate conjugate gradient update step and brings an evident performance improvement and application prospect.
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.
