Block sparse signal reconstruction using block-sparse adaptive filtering algorithms

Sparse signal reconstruction (SSR) problems based on compressive sensing (CS) arise in a broad range of application fields. Among these are the so-called "blockstructured" or "block sparse" signals with nonzero atoms occurring in clusters that occur frequently in natural signals. To make block-structured sparsity use more explicit, many block-structure-based SSR algorithms, such as convex optimization and greedy pursuit, have been developed. Convex optimization algorithms usually pose a heavy computational burden, while greedy pursuit algorithms are overly sensitive to ambient interferences, so these two types of block-structure-based SSR algorithms may not be suited for solving large-scale problems in strong interference scenarios. Sparse adaptive filtering algorithms have recently been shown to solve large-scale CS problems effectively for conventional vector sparse signals. Encouraged by these facts, we propose two novel block-structure-based sparse adaptive filtering algorithms, i.e., the "block zero attracting least mean square" (BZA-LMS) algorithm and the "block l0-norm LMS" (BL0-LMS) algorithm, to exploit their potential performance gain. Experimental results presented demonstrate the validity and applicability of these proposed algorithms.