“…where Φ is the measurement matrix with size N 1 × N that used to sample s 0 according to the criterion Although (16) is a non-deterministic polynomial-time hard (NPhard) problem, a number of computationally efficient algorithms can be used, such as the smooth L0 (SL0) algorithm and orthogonal matching pursuit (OMP) algorithm [32,33]. However, for these conventional SR/CS based algorithms, as formulated by (16), the expected frequencies are assumed to be located at fix discretised grids [∆f τ 1 , ∆f τ 2 , ..., ∆f τ L ]. The off-grid problem, i.e the mismatch between the pre-defined frequency grid and the actual frequency of signal, may cause the performance degradation [34,35].…”