Journal of Northeastern University Natural Science ›› 2018, Vol. 39 ›› Issue (1): 31-34.DOI: 10.12068/j.issn.1005-3026.2018.01.007

• Information & Control • Previous Articles     Next Articles

Spectrum Sensing Algorithm Based on Dynamic Group Sparsity Reconstruction

LIU Fu-lai1,2, LIU Lei2, DU Rui-yan1,2, ZHANG Miao2   

  1. 1. School of Computer and Communication Engineering, Northeastern University at Qinhuangdao,Qinhuangdao 066004, China; 2. School of Computer Science & Engineering, Northeastern University, Shenyang 110169, China.
  • Received:2016-07-25 Revised:2016-07-25 Online:2018-01-15 Published:2018-01-31
  • Contact: LIU Lei
  • About author:-
  • Supported by:
    -

Abstract: To solve the problem of wideband spectrum sensing in cognitive radio networks, a spectrum sensing algorithm based on the spectrum structure of primary user signals was proposed, which is called DGS-SS algorithm. Firstly, compressed sensing theory was applied to signal acquisition to achieve a sub-Nyquist rate. Secondly, the group sparsity structure of primary user spectrum was used to modify the spectrum and residual support set during the reconstruction process, which can speed up the convergence and improve the accuracy of the reconstruction of primary user spectrum. Finally, effective detection of spectrum holes was given by the reconstructed signal spectrum. Simulation results show that the proposed algorithm can accurately reconstruct the spectrum at low compression ratio and have stronger robustness to noise variation, which makes the spectrum sensing performance significantly improved.

Key words: cognitive radio, spectrum sensing, compressed sensing, dynamic group sparsity, primary user signal reconstruction

CLC Number: