Covariance-Based Spectrum Sensing for Noncircular Signal in
Cognitive Radio Networks With Uncalibrated Multiple Antennas
Abstract
In this letter, the problem of spectrum sensing is addressed for noncircular (NC) signal in cognitive radio networks with uncalibrated multiple antennas. Specifically, by taking both the standard covariance and complementary covariance information of the NC signal into account, a new robust spectrum sensing method called NC covariance (NCC) is proposed, which can fully reap the statistical property of the NC signals. Meanwhile, we derive the asymptotic distribution of the NCC statistic under the signal-absence hypothesis and obtain the theoretical decision threshold of the NCC method. Simulation results demonstrate that the proposed method is capable of outperforming state-of-the-art methods.
Index Terms:
Noncircular signal, robust spectrum sensing, complementary covariance, uncalibrated multiple antennas.I Introduction
Cognitive radio (CR) has been recognized as a powerful means to improve the spectrum efficiency by allowing secondary users (SUs) to opportunistically utilize the licensed spectrum of primary users (PUs) [1]. One major functionality of CR is the spectrum sensing (SS), which plays an important role to sense idle spectrum bands and avoid unacceptable interference to PUs[2]. In the past decade, various detection methods based on different operational requirements were proposed for SS[3]. Among them, maximum-minimum eigenvalue (MME)[4] is a very attracting method for SS with multiple antennas, due to its ability of overcoming the noise uncertainty and fading effects. However, the MME method is susceptible to unequal per-antenna noise variances as may appear in practical scenarios due to calibration errors.
In the literature, several robust multiantenna SS (MSS) methods have been proposed for overcoming this drawback, such as the covariance absolute value (CAV) [5], locally most powerful invariant test (LMPIT)[6], Hadamard (HDM) ratio test[7], volume-based detection (VD)[8] and separating function estimation test (SFET)[9] methods can deliver desirable performance under the scenario of unequal per-antenna noise variances. Nevertheless, all these methods above were devised for circular signals as they only use the standard covariance information. But practically noncircular (NC) signals, for instance offset quadrature phase shift keying (OQPSK), pulse amplitude modulation (PAM) and binary phase shift keying (BPSK) are often encountered in modern communication systems [10]. These signals contain not only the standard covariance information but also the additional complementary covariance information, which can be used for enhancing the detection performance[11]. Therefore, there has been a recent interest in developing new methods for MSS that exploit both the standard covariance and complementary covariance information. In this case, Huang et al. [12] proposed a NC-HDM method to exploit the NC characteristic of the primary signals for MSS, and they showed that the NC-HDM method can significantly improve the performance of the original HDM method. However, the calculation of the NC-HDM test statistic involves matrix determinant computation, which incurs significant computational cost. More recently, a NC local average variance (NC-LAV) method was developed in [13]. However, the NC-LAV method relies heavily on the assumption that the noise variances at all antennas are identical, thereby its performance is also sensitive to unequal per-antenna noise variances.
In this letter, we consider the SS problem for NC signal in CR networks with multiple receive antennas, focusing on the scenario where the antennas experience different levels of noise power. To leverage the benefits of the NC signal, we propose a new robust SS method named NC covariance (NCC) for such networks. Specifically, we show that the standard covariance and complementary covariance matrices of the received signals differ between the null and the alternate hypotheses, which can be used for detecting the presence of PUs. Moreover, an asymptotic distribution of the NCC statistic under the null hypothesis is derived to acquire the theoretical formula for the decision threshold. In addition, we also analyze the computational complexity of the proposed NCC method. Simulation results show that NCC outperforms the existing state-of-the-art methods.
Notation: Throughout this letter, we use boldface lowercase and uppercase letters to designate vectors and matrices, respectively. Superscripts , and indicate the complex conjugate, transpose, and Hermitian transpose, respectively. While denotes the absolute value operation, is the expected value of the complex-valued random variable and denotes its variance. The symbols and refer to the identity and all-zero matrices, respectively. The trace of a square matrix is denoted by . A random variable follows the real Gaussian distribution with mean and covariance is shown by , while a complex-valued random variable follows the circularly symmetric complex Gaussian distribution (CSCG) with mean and covariance is denoted by .
II Signal Model
II-A Standard and Complementary Covariance Matrices
Let denote a zero-mean complex random vector. The matrix is the standard covariance matrix of , which is a Hermitian positive-definite matrix. While the matrix is the complementary covariance matrix of , and is complex symmetric. The random vector is circular if its complementary covariance matrix and noncircular if [10]. Therefore, to fully capture the complete statistical characterization of a zero-mean noncircular random signal , both and should be taken into account for the detector design.
II-B Problem Description
In this work, we consider the CR network consisting of one SU equipped with uncalibrated antennas and single-antenna PUs, where the SU attempts to detect the signals emitted by PUs. Denote as the null hypothesis that all PUs are absent and as the alternative hypothesis that at least one PU is present. Mathematically, the signal vector received at the SU corresponding to the th time instant can be written as[12]
(1) |
where denotes the total number of received samples, is the zero-mean CSCG noise vector with an unknown diagonal covariance matrix , i.e., . Note that is possibly unequal to for due to the uncalibrated receiver in practice. denotes the channel matrix between the SU and PUs, which is assumed to be kept unchanged within a detection period. Additionally, is the source signal vector, in which the symbol signal emitted by the th PU is assumed to be noncircular (i.e., ), identically distributed with mean zero and variance . Meanwhile, we suppose that signal and noise are statistically independent.
III Proposed Noncircular Covariance Method
Let us first consider the standard covariance and complementary covariance matrices of the received signal vector , given as
(2) |
Under the null hypothesis , and are respectively given as
(3) | ||||
Meanwhile, under the alternative hypothesis , we can derive and as
(4) | ||||
where and are respectively the standard covariance and complementary covariance matrices of the transmitted signal . It is clear from the above derivation that , and , where and denote the th element of and , respectively. Meanwhile, we can notice that under , is a diagonal matrix and is a zero matrix. However, under the alternative hypothesis , the off-diagonal elements of and all the elements of are nonzeros. Combing all above observations, we let
(5) |
If the signal is absent, . While if the signal is present, . Hence, can be leveraged to distinguish between hypotheses and .
It should be noted that, in practical scenarios, the standard covariance and complementary covariance matrices (i.e., and ) can only be computed via a limited number of samples, as given by
(6) |
Therefore, we propose a NCC method based on (5) as
(7) |
where is the test statistic of the proposed NCC method, and denote the elements of and at the th row and the th column, respectively. Given a predefined decision threshold , if , the signal is present (“” decision); otherwise, signal is not present (“” decision).
III-A False Alarm Probability and Decision Threshold
In this subsection, we will derive the asymptotic distribution of the NCC statistic under the null hypothesis, which enable us to calculate the decision threshold for each given false alarm probability.
Lemma 1
With a sufficiently large , the random variable under hypothesis approximately follows the central chi-square distribution with degrees of freedom (DoFs), i.e.,
(8) |
where is the central chi-square distribution with DoFs.
Proof:
Under hypothesis , the received signal vector only consists of noise vector , i,e., . Accordingly, . Denoting the th and th element of the received signal vector by and , respectively. Then and are independent for . In what follows, we divide the proof procedure into the two steps for the convenience of derivations.
1) In the first step, the distributions of the random variables , , and will be derived. Since and are respectively the th element of and . Hence, from (6), we notice that and can be respectively expressed as and . Because and , therefore, we obtain and
(9) |
Using the expression of the statistical variance and invoking the following formula [14]:
(10) |
we can get
(11) |
and
(12) |
In (III-A), are the complex Gaussian random variables. Therefore, with a sufficiently large , by using the central limit theorem, we can obtain
(13) | |||
(14) |
Additionally, with the aid of (III-A), it is easy to verify that the random variables , , and are independent of each other.
2) From (13) and (14), we can verify that
(15) | |||
(16) |
Notice from above that, , thereby, for a large , we obtain and . Thus
(17) |
Taking (17) into (15) and (16) yields
(18) | |||
(19) | |||
(20) |
Moreover, we have , and . Since all the random variables , and are statistically independent, hence, , and are approximately independent. Note that the variable is the sum of independent random variables, thus we have . Similarly, we also can get and . Based on the above derivations, the variable follows the chi-squared distribution with DOFs, i.e., . Thus the false alarm probability for the proposed method can be obtained as
where the function is the tail probability of the chi-squared distribution with DOFs [15]. ∎
Hence, with a predefined , the corresponding decision threshold can be given as
(21) |
in which is the inverse function of .
III-B Computational Complexity
In this subsection, the complexity of the proposed NCC method is evaluated in terms of the number of complex multiplications, and is compared to that of two peer methods, i.e., the NC-HDM and NC-LAV methods. The computational complexity of the proposed NCC method is determined by the three parts. The first part is to calculate the upper triangular part of the the matrix , which requires complex multiplications. The second part is to compute the upper triangular part of the the matrix , which requires complex multiplications. The third part is to calculate the test statistic , which requires complex multiplications. Hence, the total numbers of required complex multiplications for the proposed method is , and the corresponding complexity is in the order of .
As analyzed in [13], the complexities of the NC-LAV and NC-HDM methods are respectively in the orders of and . Therefore, the proposed NCC method enjoys the same complexity order with the NC-LAV method, and both exhibit lower complexity than the NC-HDM method.
IV Simulation results
We now conduct experiments to compare the performance of the proposed NCC method with the following seven methods: CAV [5], LMPIT[6], HDM[7], VD[8], SFET[9], NC-HDM[12], and NC-LAV[13]. At each run, the elements in are drawn independent and identically distributed from , and the noise powers are independently drawn from the uniform distribution within dB, while the noise parameter is set as in the simulations. Additionally, the th primary signal is assumed to be independent BPSK constellation with different power , and the average signal-to-noise ratio (SNR) is defined as 10log, each simulation result is averaged over independent Monte Carlo runs.
Figs. 1(a) and (b) plot the detection probability as a function of SNR for the eight methods under the scenario of unequal per-antenna noise variances when , where in Fig. 1(a), the simulation parameters are set as , and ; Meanwhile, in Fig. 1(b), the simulation parameters are set as , and . From both figures, we can make the following observations. First, one can clearly observe that the proposed method is superior to all other methods in terms of detection probability. For example, in Fig. 1(a), the proposed NCC method achieves at least 0.5 dB gain compared with the other methods at detection probability of 80%. Moreover, in Fig. 1(b), when SNR dB, the proposed method offers higher detection probability than its counterparts by at least 10%. Second, it is observed that increasing the SNR can produce a performance gain to all compared methods. Figs. 2(a) and (b) display the receiver operating characteristic (ROC) curves for all compared methods (i.e., detection probability versus false alarm probability), where SNR dB and SNR dB are set in Figs. 2(a) and (b), respectively. There we first see that increasing the false alarm probability is beneficial for all considered methods, i.e., as increases, the detection probabilities of all methods progressively go to one. Next we see that the detection performance of NCC is noticeably better than that of other methods. For example, in both figures, to attain a detection probability of 0.8, the proposed NCC method requires lower than its counterparts.
Discussion on simulation results: From Figs. 1(a)-1(b) and 2(a)-2(b), we can see that the NCC and NC-HDM have better detection performance than that of other methods, this is because both NCC and NC-HDM methods can exploit the additional information contained in the complementary covariance matrix of received samples, leads to considerable performance gain. Although the NC-LAV method is devised to exploit the NC characteristic of the primary signals. However, this method is developed under the assumption that the noise variances at all antennas are identical, thereby it cannot provide a desirable performance in the scenario of unequal per-antenna noise variances.
V Conclusion
In this letter, the spectrum sensing problem in multiantenna CR networks with NC primary signals was addressed under the scenario of unequal per-antenna noise variances, and a low-complexity NCC method was proposed to exploit the NC characteristic of the primary signals. Numerical results show that the NCC method is superior to the state-of-the-art detection methods.
References
- [1] M. Xu, M. Jin, Q. Guo, and Y. Li, “Multichannel selection for cognitive radio networks with RF energy harvesting,” IEEE Wireless Commun. Lett., vol. 7, no. 2, pp. 178–181, Apr. 2018.
- [2] A. Bishnu and V. Bhatia, “Logdet covariance based spectrum sensing under colored noise,” IEEE Trans. Veh. Technol., vol. 67, no. 7, pp. 6716–6720, Jul. 2018.
- [3] F. Awin, E. Abdel-Raheem, and K. Tepe, “Blind spectrum sensing approaches for interweaved cognitive radio system: A tutorial and short course,” IEEE Commun. Surveys Tuts., vol. 21, no. 1, pp. 238–259, 1st Quart. 2019.
- [4] Y. Zeng and Y. C. Liang, “Eigenvalue-based spectrum sensing algorithms for cognitive radio,” IEEE Trans.Commun., vol. 57, no. 6, pp. 1784–1793, Jun. 2009.
- [5] ——, “Spectrum-sensing algorithms for cognitive radio based on statistical covariances,” IEEE Trans. Veh. Technol., vol. 58, no. 4, pp. 1804–1815, May 2009.
- [6] D. Ram rez, J. V a, I. Santamaria, and I. Santamar a, “The locally most powerful test for multiantenna spectrum sensing with uncalibrated receivers,” in Proc. IEEE Int. Conf. Acoust. Speech. Signal Process., Mar. 2012, pp. 3437–3440.
- [7] L. Huang, Y. Xiao, H. C. So, and J. Fang, “Accurate performance analysis of hadamard ratio test for robust spectrum sensing,” IEEE Trans. Wireless Commun., vol. 14, no. 2, pp. 750–758, Feb. 2015.
- [8] L. Huang, C. Qian, Y. Xiao, and Q. T. Zhang, “Performance analysis of volume-based spectrum sensing for cognitive radio,” IEEE Trans. Wireless Commun., vol. 14, no. 1, pp. 317–330, Jan. 2015.
- [9] Z. Pourgharehkhan, A. Taherpour, and S. Gazor, “Spectrum sensing using a uniform uncalibrated linear antenna array for cognitive radios,” IEEE Trans. Wireless Commun., vol. 18, no. 2, pp. 741–752, Feb. 2019.
- [10] P. J. Schreier and L. L. Scharf, Statistical Signal Processing of Complex-Valued Data: The Theory of Improper and Noncircular Signals. Cambridge, U.K.: Cambridge Univ. Press, 2010.
- [11] A. S. Cacciapuoti, M. Caleffi, and L. Paura, “Widely linear cooperative spectrum sensing for cognitive radio networks,” in Proc. IEEE Global Telecommun. Conf. (GLOBECOM), Dec. 2010, pp. 1–5.
- [12] L. Huang, Y. Xiao, and Q. T. Zhang, “Robust spectrum sensing for noncircular signal in multiantenna cognitive receivers,” IEEE Trans. Signal Process., vol. 63, no. 2, pp. 498–511, Jan. 2015.
- [13] A. Z. Chen, Z. P. Shi, H. Sun, Z. Q. He, F. Bu, and D. Yang, “A low-complexity spectrum sensing method for noncircular signal in cognitive radio networks with multiple receive antennas,” IEEE Commun. Lett., vol. 23, no. 7, pp. 1190–1193, Jul. 2019.
- [14] P. H. M. Janssen and P. Stoica, “On the expectation of the product of four matrix-valued gaussian random variables,” IEEE Trans. Autom. Control., vol. 33, no. 9, pp. 867–870, Sep. 1988.
- [15] S. M. Kay, Fundamentals of statistical signal processing, Vol. II: Detection Theory. Upper Saddle River, NJ: Prentice Hall, 1998.