He Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
He Li has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Minglu Jin
Dalian University of Technology
3 shared publications - Wenjing Zhao
School of Electronic Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
3 shared publications - Sang-Jo Yoo
Department of Electrical and Computer Engineering, Inha University, Incheon, South Korea
2 shared publications Chang Liu
School of Information and Communication Engineering, Dalian University of Technology, Dalian, 116024 China
1 shared publication- Guolong Cui
University of Electronic Science and Technology of China
1 shared publication Xuesong Luo
School of Information and Communication Engineering, Dalian University of Technology, Dalian, China
1 shared publication
Latest Publications
- 29 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (3) , 3315-3319
Fusion Test Statistics Based Mixture Detector for Spectrum Sensing
In this paper, two widely used spectrum sensing algorithms, sphericity test and energy detection are considered. The statistics of sphericity test and energy detector with estimated noise power are weighted and fused to propose a mixture detector. The proposed mixture detector based on the fusion test statistics can simultaneously utilize the power information and correlation feature of the received signals. Specifically, the theoretical optimal weight is derived by maximizing the deflection coefficient of the mixture detector. Besides, the analytical expressions for the decision threshold, false alarm probability and detection probability of this algorithm are derived by moment-matching Beta approximation. Numerical examples are provided to illustrate the validity of theoretical analysis. And simulations show that the proposed mixture detector with optimal weight can improve the spectrum sensing performance compared with existing algorithms.
- 29 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 71 (3) , 3315-3319
Fusion Test Statistics Based Mixture Detector for Spectrum Sensing
In this paper, two widely used spectrum sensing algorithms, sphericity test and energy detection are considered. The statistics of sphericity test and energy detector with estimated noise power are weighted and fused to propose a mixture detector. The proposed mixture detector based on the fusion test statistics can simultaneously utilize the power information and correlation feature of the received signals. Specifically, the theoretical optimal weight is derived by maximizing the deflection coefficient of the mixture detector. Besides, the analytical expressions for the decision threshold, false alarm probability and detection probability of this algorithm are derived by moment-matching Beta approximation. Numerical examples are provided to illustrate the validity of theoretical analysis. And simulations show that the proposed mixture detector with optimal weight can improve the spectrum sensing performance compared with existing algorithms.
- Open Access
- 1 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 29 (6) , 1201-1206
A Novel Goodness of Fit Test Spectrum Sensing Using Extreme Eigenvalues
The existing Goodness of fit (GoF) test based spectrum sensing algorithms mostly use samples or energies as observations to make decisions, which can hardly achieve satisfactory performance especially when the Primary user (PU) signals are highly correlated. Meanwhile, the eigenvalue of covariance matrix can reflect signal correlations well. Motivated by this, we study the distribution of eigenvalue and propose an eigenvalue based GoF spectrum sensing algorithm. In the proposed scheme, we use the ratios of maximum to minimum eigenvalue as observations and thus it can bring performance improvements through capturing correlation of PU signals. We also provide the related theoretical analysis for the proposed method. Simulation results show that the proposed method overcomes the problem of noise uncertainty and achieves performance improvement over the classical samples-based GoF test.
- 1 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 29 (6) , 1201-1206
Open AccessA Novel Goodness of Fit Test Spectrum Sensing Using Extreme Eigenvalues
The existing Goodness of fit (GoF) test based spectrum sensing algorithms mostly use samples or energies as observations to make decisions, which can hardly achieve satisfactory performance especially when the Primary user (PU) signals are highly correlated. Meanwhile, the eigenvalue of covariance matrix can reflect signal correlations well. Motivated by this, we study the distribution of eigenvalue and propose an eigenvalue based GoF spectrum sensing algorithm. In the proposed scheme, we use the ratios of maximum to minimum eigenvalue as observations and thus it can bring performance improvements through capturing correlation of PU signals. We also provide the related theoretical analysis for the proposed method. Simulation results show that the proposed method overcomes the problem of noise uncertainty and achieves performance improvement over the classical samples-based GoF test.
- 1 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 15 (3) , 3391-3402
Eigenvalues-Based Universal Spectrum Sensing Algorithm in Cognitive Radio Networks
The eigenvalues of the sample covariance matrix can capture signal correlations and noise characteristics well, which are widely used for spectrum sensing in cognitive radio networks. Some totally blind spectrum sensing algorithms were proposed, such as maximum eigenvalue-to-arithmetic mean (ME–AM), maximum eigenvalue-to-geometric mean (ME–GM), and arithmetic-to-geometric mean of eigenvalues (AGM) methods. This article makes full use of the advantages of these algorithms and proposes a universal spectrum sensing algorithm based on maximum eigenvalue, arithmetic mean, and geometric mean of eigenvalues. The proposed algorithm takes the weighted geometric mean of the test statistics of the ME–AM and AGM algorithms as new test statistic and includes the ME–AM, ME–GM, and AGM algorithms as special cases. Following the random matrix theory framework, in a similar vein to the ME–AM and ME–GM algorithms, we derive the analytical expressions of false alarm probability, threshold, and detection probability of the proposed method using the Tracy–Widom distribution of maximum eigenvalue. In addition, we discuss the problem of designing the optimal weighting factor through theoretical analysis and simulation experiments. Finally, simulation results verify that the universal algorithm can effectively improve the detection performance.
- 1 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 15 (3) , 3391-3402
Eigenvalues-Based Universal Spectrum Sensing Algorithm in Cognitive Radio Networks
The eigenvalues of the sample covariance matrix can capture signal correlations and noise characteristics well, which are widely used for spectrum sensing in cognitive radio networks. Some totally blind spectrum sensing algorithms were proposed, such as maximum eigenvalue-to-arithmetic mean (ME–AM), maximum eigenvalue-to-geometric mean (ME–GM), and arithmetic-to-geometric mean of eigenvalues (AGM) methods. This article makes full use of the advantages of these algorithms and proposes a universal spectrum sensing algorithm based on maximum eigenvalue, arithmetic mean, and geometric mean of eigenvalues. The proposed algorithm takes the weighted geometric mean of the test statistics of the ME–AM and AGM algorithms as new test statistic and includes the ME–AM, ME–GM, and AGM algorithms as special cases. Following the random matrix theory framework, in a similar vein to the ME–AM and ME–GM algorithms, we derive the analytical expressions of false alarm probability, threshold, and detection probability of the proposed method using the Tracy–Widom distribution of maximum eigenvalue. In addition, we discuss the problem of designing the optimal weighting factor through theoretical analysis and simulation experiments. Finally, simulation results verify that the universal algorithm can effectively improve the detection performance.