Signal recovery from multiple measurement vectors via tunable random projection and boost

The problem of recovering a sparse solution from Multiple Measurement Vectors (MMVs) is a fundamental issue in the field of signal processing. However, the performance of existing recovery algorithms is far from satisfactory in terms of maximum recoverable sparsity level and minimum number of measurements required. In this paper, we present a high-performance recovery method which mainly has two parts: a versatile recovery framework named RPMB and a high-performance algorithm for it. Specifically, the RPMB framework improves the recovery performance by randomly projecting MMV onto a subspace with lower and tunable dimension in an iterative procedure. RPMB provides a generalized framework in which the popular ReMBo (Reduce MMV and Boost) algorithm can be regarded as a special case. Furthermore, an effective algorithm that can be embedded in RPMB is also proposed based on a new support identification strategy. Numerical experiments demonstrate that the proposed method outperforms state-of-the-art methods in terms of recovery performance