Block spectrum sensing based on prior information in cognitive radio networks

Spectrum sensing is an important topic in cognitive radio networks. The traditional schemes suffer from high time consumption, hardware loss and computational complexity. To overcome the above shortcomings, compressed sensing is integrated into cognitive radio networks. In this paper, we propose two compressed spectrum sensing algorithms called Logit Weighted Block Orthogonal Matching Pursuit (LW-BOMP) and Logit Weighted Block Orthogonal Matching Pursuit with Joint Judgement (LW-BOMP-J), which exploit the block sparsity and prior information. The first algorithm integrates support probabilities into the matching pursuit procedure, and the second algorithm extends the first one to the scenario with inaccurate block support probabilities. The performance of the algorithms is simulated and compared with conventional algorithm. The results show that the proposed algorithms are more promising in reconstructing original spectrum and LW-BOMP-J is better than LW-BOMP under the inaccurate prior information condition.

[1]  Yonina C. Eldar,et al.  Sub-Nyquist Cyclostationary Detection for Cognitive Radio , 2016, IEEE Transactions on Signal Processing.

[2]  Zixuan Zhang,et al.  Cooperative spectrum sensing based on Block Stagewise Orthogonal Matching Pursuit , 2016, 2016 2nd IEEE International Conference on Computer and Communications (ICCC).

[3]  Cheng-Xiang Wang,et al.  Wideband spectrum sensing for cognitive radio networks: a survey , 2013, IEEE Wireless Communications.

[4]  Dennis Goeckel,et al.  Mitigation of spectral leakage for single carrier, block-processing cognitive radio receivers , 2017 .

[5]  Jamie S. Evans,et al.  Compressed Sensing With Prior Information: Information-Theoretic Limits and Practical Decoders , 2013, IEEE Transactions on Signal Processing.

[6]  Ronald F. Boisvert,et al.  NIST Handbook of Mathematical Functions , 2010 .

[7]  Zhengchun Zhou,et al.  Sharp Sufficient Conditions for Stable Recovery of Block Sparse Signals by Block Orthogonal Matching Pursuit , 2016, Applied and Computational Harmonic Analysis.

[8]  E. Candès The restricted isometry property and its implications for compressed sensing , 2008 .

[9]  R. B. Deshmukh,et al.  A Systematic Review of Compressive Sensing: Concepts, Implementations and Applications , 2018, IEEE Access.

[10]  Chunyan Feng,et al.  Sparsity Order Estimation and its Application in Compressive Spectrum Sensing for Cognitive Radios , 2012, IEEE Transactions on Wireless Communications.

[11]  Hüseyin Arslan,et al.  A survey of spectrum sensing algorithms for cognitive radio applications , 2009, IEEE Communications Surveys & Tutorials.

[12]  Bill Randall Weston Approximations to the noncentral Chi-square and noncentral F distributions , 1978 .

[13]  David L Donoho,et al.  Compressed sensing , 2006, IEEE Transactions on Information Theory.

[14]  Lu Cao,et al.  A Sequential Compressed Spectrum Sensing Algorithm against SSDH Attack in Cognitive Radio Networks , 2018, J. Electr. Comput. Eng..

[15]  R. Saravanan,et al.  Spectrum sensing review in cognitive radio , 2013, 2013 International Conference on Emerging Trends in VLSI, Embedded System, Nano Electronics and Telecommunication System (ICEVENT).

[16]  Yun Tian,et al.  Compressed Sensing Reconstruction Algorithms with Prior Information: Logit Weight Simultaneous Orthogonal Matching Pursuit , 2014, 2014 IEEE 79th Vehicular Technology Conference (VTC Spring).

[17]  I. S. Gradshteyn,et al.  Table of Integrals, Series, and Products , 1976 .

[18]  MinChul Ju,et al.  Cognitive Radio Networks With Secondary Network Selection , 2016, IEEE Transactions on Vehicular Technology.