Abstract
Recently, block-sparse signals, whose nonzero coefficients appearing in blocks, have received much attention. A corresponding block-based orthogonal greedy algorithm (OGA) was proved by Eldar to successfully recover ideal noiseless block-sparse signals under a certain condition on block-coherence. In this paper, the stability problem of block OGA used to recover the noisy block-sparse signals is studied and the corresponding approximation bounds are derived. The theoretical bounds presented in this paper are more general and are proven to include those reported by Donoho and Tseng. Numerical experimental results are presented to support the validity and correctness of theoretical derivation. The simulation results also show that in the noisy case, the block OGA can be proved to achieve better reconstruction performance than the OGA when the conventional sparse signals are represented in block-sparse forms.
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.
