Spectrum sensing algorithm based on the eigenvalue of Wishart random matrix
In order to improve the spectrum sensing performance and overcome the shortcomings of the classical algorithm,a new cooperative spectrum sensing algorithm based on Wishart random matrix theory was proposed.According to the logarithmic distribution characteristics of the sampled covariance matrix eig...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2017-09-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2017255/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In order to improve the spectrum sensing performance and overcome the shortcomings of the classical algorithm,a new cooperative spectrum sensing algorithm based on Wishart random matrix theory was proposed.According to the logarithmic distribution characteristics of the sampled covariance matrix eigenvalues and using the ratio of maximum eigenvalue and geometric mean eigenvalue,a simple closed-form threshold expression could be obtained,and the spectrum sensing decision could be performed depend on the threshold.The simulation results show that the proposed algorithm can get better sensing performance even under the conditions of a few number of cooperative users,low signal to noise ratio and a few samples.It is less affected by false-alarm probability and the extreme values,and has better detection performance than similar algorithms. |
|---|---|
| ISSN: | 1000-0801 |