The Analysis of Block Joint Sparse Recovery Using Block Signal Space Matching Pursuit

Abstract

In many practical applications, we need to recover block sparse signals. In this paper, we encounter the system model where joint sparse signals exhibit block structure. To reconstruct this category of signals, we propose a new algorithm called block signal subspace matching pursuit (BSSMP) for the block joint sparse recovery problem in compressed sensing, which simultaneously reconstructs the support of block jointly sparse signals from a common sensing matrix. To begin with, we consider the case where block joint sparse matrix X has full column rank and any r nonzero row-blocks are linearly independent. Based on these assumptions, our theoretical analysis indicates that the BSSMP algorithm could reconstruct the support of X through at most \(k - r + \left\lceil {{r \over L}} \right\rceil\) iterations if sensing matrix A satisfies the block restricted isometry property of order L(K − r) + r + 1 with \({\delta _{{B_{L( {K - r}) + r + 1}}}}< \max \{{{{\sqrt r} \over {\sqrt {K + {r \over 4}} + \sqrt {{r \over 4}} }},{{\sqrt L} \over {\sqrt {Kd} + \sqrt L}}}\}\). This condition improves the existing result.