Abstract
Compressed spectrum sensing naturally pursues the use of fewer sampling resources to achieve spectrum support reconstruction and signal recovery. The theoretical lower boundary of averaging sampling rate to recover the multiband signal has been proved to be twice the Landau rate. However, it is still unreachable in practice. Based on the multicoset sampling architecture, this paper analyzes the influencing factors on perfect spectrum reconstruction from three aspects: data model, sampling pattern and greedy reconstruction algorithms, for which practical and feasible optimization schemes are proposed. To reduce redundant reconstruction for the multiple measurement vectors (MMV) signal model, a block MMV model is proposed to improve the accuracy in the spectrum support set reconstruction process. A sampling pattern selection algorithm is proposed to ensure a higher success rate of the spectrum support reconstruction to optimize the sensing matrix. We also deduced the representation of the signal and noise energy in the reconstructed spectrum based on the mathematical model of compressed sensing. We thus proposed a non-orthogonal double-threshold matching pursuit algorithm to avoid a high false-alarm rate due to the manually set converging conditions for matching pursuit algorithms. Numerical experiments on real-world wideband signals are carried out to demonstrate the feasibility and advantages of the proposed approaches. With integrated optimization, the required sampling density to ensure perfect reconstruction is approaching the sub-Nyquist sampling boundary.