This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

Covariance-Based Spectrum Sensing for Noncircular Signal in
Cognitive Radio Networks With Uncalibrated Multiple Antennas

An-Zhi Chen and Zhi-Ping Shi, A.-Z. Chen and Z.-P. Shi are with the National Key Lab of Science and Technology on Communications, University of Electronic Science and Technology of China, Chengdu 611731, China (e-mail: [email protected]; [email protected]).
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 ()(\cdot)^{\ast}, ()T(\cdot)^{T} and ()H(\cdot)^{H} indicate the complex conjugate, transpose, and Hermitian transpose, respectively. While |||\cdot| denotes the absolute value operation, 𝔼[x]\mathbb{E}[x] is the expected value of the complex-valued random variable xx and 𝔻[x]=𝔼[|x|2]|𝔼[x]|2\mathbb{D}[x]=\mathbb{E}[|x|^{2}]-|\mathbb{E}[x]|^{2} denotes its variance. The symbols 𝐈M\mathbf{I}_{M} and 𝟎M\mathbf{0}_{M} refer to the M×MM\times M identity and all-zero matrices, respectively. The trace of a square matrix 𝐗\mathbf{X} is denoted by tr(𝐗)\text{tr}(\mathbf{X}). A random variable aa follows the real Gaussian distribution with mean μr\mu_{r} and covariance σr2\sigma_{r}^{2} is shown by a𝒩(μr,σr2)a\sim\mathcal{N}(\mu_{r},\sigma_{r}^{2}), while a complex-valued random variable bb follows the circularly symmetric complex Gaussian distribution (CSCG) with mean μc\mu_{c} and covariance σc2\sigma_{c}^{2} is denoted by b𝒩(μc,σc2)b\sim\mathcal{N}(\mu_{c},\sigma_{c}^{2}).

II Signal Model

II-A Standard and Complementary Covariance Matrices

Let 𝐳M×1\mathbf{z}\in\mathbb{C}^{M\times 1} denote a zero-mean complex random vector. The matrix 𝐑𝐳=𝔼[𝐳𝐳H]\mathbf{R}_{\mathbf{z}}=\mathbb{E}\big{[}\mathbf{z}\mathbf{z}^{H}\big{]} is the standard covariance matrix of 𝐳\mathbf{z}, which is a Hermitian positive-definite matrix. While the matrix 𝐂𝐳=𝔼[𝐳𝐳T]\mathbf{C}_{\mathbf{z}}=\mathbb{E}\big{[}\mathbf{z}\mathbf{z}^{T}\big{]} is the complementary covariance matrix of 𝐳\mathbf{z}, and is complex symmetric. The random vector 𝐳\mathbf{z} is circular if its complementary covariance matrix 𝐂𝐳=𝟎M\mathbf{C}_{\mathbf{z}}=\mathbf{0}_{M} and noncircular if 𝐂𝐳𝟎M\mathbf{C}_{\mathbf{z}}\neq\mathbf{0}_{M} [10]. Therefore, to fully capture the complete statistical characterization of a zero-mean noncircular random signal 𝐳\mathbf{z}, both 𝐑𝐳\mathbf{R}_{\mathbf{z}} and 𝐂𝐳\mathbf{C}_{\mathbf{z}} 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 MM uncalibrated antennas and qq single-antenna PUs, where the SU attempts to detect the signals emitted by qq PUs. Denote 0\mathcal{H}_{0} as the null hypothesis that all PUs are absent and 1\mathcal{H}_{1} as the alternative hypothesis that at least one PU is present. Mathematically, the signal vector 𝐲(k)M×1\mathbf{y}(k)\in\mathbb{C}^{M\times 1} received at the SU corresponding to the kkth time instant can be written as[12]

{0:𝐲k=𝐰k,1:𝐲k=𝐇𝐬k+𝐰k,k=1,,K\begin{cases}\mathcal{H}_{0}:&\mathbf{y}_{k}=\mathbf{w}_{k},\\ \mathcal{H}_{1}:&\mathbf{y}_{k}=\mathbf{H}\mathbf{s}_{k}+\mathbf{w}_{k},\end{cases}k=1,\ldots,K (1)

where KK denotes the total number of received samples, 𝐰kM×1\mathbf{w}_{k}\in\mathbb{C}^{M\times 1} is the zero-mean CSCG noise vector with an unknown diagonal covariance matrix 𝐑w=diag{σ12,σ22,,σM2}\mathbf{R}_{w}=\text{diag}\{\sigma^{2}_{1},\sigma^{2}_{2},\ldots,\sigma^{2}_{M}\}, i.e., 𝐰k𝒞𝒩(𝟎,𝐑w)\mathbf{w}_{k}\sim\mathcal{CN}(\mathbf{0},\mathbf{R}_{w}). Note that σm2\sigma^{2}_{m} is possibly unequal to σn2\sigma^{2}_{n} for mnm\neq n due to the uncalibrated receiver in practice. 𝐇M×q\mathbf{H}\in\mathbb{C}^{M\times q} denotes the channel matrix between the SU and PUs, which is assumed to be kept unchanged within a detection period. Additionally, 𝐬k=[s1(k),,sq(k)]T\mathbf{s}_{k}=[s_{1}(k),\ldots,s_{q}(k)]^{T} is the source signal vector, in which the symbol signal si(k)(i=1,,q)s_{i}(k)~{}(i=1,\ldots,q) emitted by the iith PU is assumed to be noncircular (i.e., 𝔼[si2(k)]0\mathbb{E}[s_{i}^{2}(k)]\neq 0), identically distributed with mean zero and variance γi=𝔼[|si(k)|2]\gamma_{i}=\mathbb{E}[|s_{i}(k)|^{2}]. Meanwhile, we suppose that signal 𝐬k\mathbf{s}_{k} and noise 𝐰k\mathbf{w}_{k} are statistically independent.

III Proposed Noncircular Covariance Method

Let us first consider the standard covariance and complementary covariance matrices of the received signal vector 𝐲k\mathbf{y}_{k}, given as

𝐑𝐲=𝔼[𝐲k𝐲kH]and𝐂𝐲=𝔼[𝐲k𝐲kT].\mathbf{R}_{\mathbf{y}}=\mathbb{E}\big{[}\mathbf{y}_{k}\mathbf{y}^{H}_{k}\big{]}~{}\text{and}~{}\mathbf{C}_{\mathbf{y}}=\mathbb{E}\big{[}\mathbf{y}_{k}\mathbf{y}^{T}_{k}\big{]}. (2)

Under the null hypothesis 0\mathcal{H}_{0}, 𝐑𝐲\mathbf{R}_{\mathbf{y}} and 𝐂𝐲\mathbf{C}_{\mathbf{y}} are respectively given as

𝐑𝐲|0=𝐑w=𝔼[𝐰k𝐰kH]=diag{σ12,σ22,,σM2},\displaystyle\mathbf{R}_{\mathbf{y}}|\mathcal{H}_{0}=\mathbf{R}_{w}=\mathbb{E}\big{[}\mathbf{w}_{k}\mathbf{w}^{H}_{k}\big{]}=\text{diag}\{\sigma^{2}_{1},\sigma^{2}_{2},\ldots,\sigma^{2}_{M}\}, (3)
𝐂𝐲|0=𝔼[𝐰k𝐰kT]=𝟎M.\displaystyle\mathbf{C}_{\mathbf{y}}|\mathcal{H}_{0}=\mathbb{E}\big{[}\mathbf{w}_{k}\mathbf{w}^{T}_{k}\big{]}=\mathbf{0}_{M}.

Meanwhile, under the alternative hypothesis 1\mathcal{H}_{1}, we can derive 𝐑𝐲|1\mathbf{R}_{\mathbf{y}}|\mathcal{H}_{1} and 𝐂𝐲|1\mathbf{C}_{\mathbf{y}}|\mathcal{H}_{1} as

𝐑𝐲|1\displaystyle\mathbf{R}_{\mathbf{y}}|\mathcal{H}_{1} =𝔼[(𝐇𝐬k+𝐰k)(𝐇𝐬k+𝐰k)H]\displaystyle=\mathbb{E}\Big{[}\big{(}\mathbf{H}\mathbf{s}_{k}+\mathbf{w}_{k}\big{)}\big{(}\mathbf{H}\mathbf{s}_{k}+\mathbf{w}_{k}\big{)}^{H}\Big{]} (4)
=𝐇𝐑𝐬𝐇H+diag{σ12,σ22,,σM2},\displaystyle=\mathbf{H}\mathbf{R}_{\mathbf{s}}\mathbf{H}^{H}+\text{diag}\{\sigma^{2}_{1},\sigma^{2}_{2},\ldots,\sigma^{2}_{M}\},
𝐂𝐲|1\displaystyle\mathbf{C}_{\mathbf{y}}|\mathcal{H}_{1} =𝔼[(𝐇𝐬k+𝐰k)(𝐇𝐬k+𝐰k)T]\displaystyle=\mathbb{E}\Big{[}\big{(}\mathbf{H}\mathbf{s}_{k}+\mathbf{w}_{k}\big{)}\big{(}\mathbf{H}\mathbf{s}_{k}+\mathbf{w}_{k}\big{)}^{T}\Big{]}
=𝐇𝐂𝐬𝐇T.\displaystyle=\mathbf{H}\mathbf{C}_{\mathbf{s}}\mathbf{H}^{T}.

where 𝐑𝐬\mathbf{R}_{\mathbf{s}} and 𝐂𝐬\mathbf{C}_{\mathbf{s}} are respectively the standard covariance and complementary covariance matrices of the transmitted signal 𝐬k\mathbf{s}_{k}. It is clear from the above derivation that (rmm)>0(r_{mm}\in\mathbb{R})>0, (rmn=rnm)(r_{mn}=r^{\ast}_{nm})\in\mathbb{C} and (cmn=cnm)(c_{mn}=c_{nm})\in\mathbb{C}, where rmnr_{mn} and cmnc_{mn} denote the (m,n)(m,n)th element of 𝐑𝐲\mathbf{R}_{\mathbf{y}} and 𝐂𝐲\mathbf{C}_{\mathbf{y}}, respectively. Meanwhile, we can notice that under 0\mathcal{H}_{0}, 𝐑𝐲|0\mathbf{R}_{\mathbf{y}}|\mathcal{H}_{0} is a diagonal matrix and 𝐂𝐲|0\mathbf{C}_{\mathbf{y}}|\mathcal{H}_{0} is a zero matrix. However, under the alternative hypothesis 1\mathcal{H}_{1}, the off-diagonal elements of 𝐑𝐲|1\mathbf{R}_{\mathbf{y}}|\mathcal{H}_{1} and all the elements of 𝐂𝐲|1\mathbf{C}_{\mathbf{y}}|\mathcal{H}_{1} are nonzeros. Combing all above observations, we let

T=nm=1M1|rmn|2rmmrnn+m=1M|cmm|22rmm2+nm=1M1|cmn|2rmmrnn,T=\sum_{n-m=1}^{M-1}\frac{|r_{mn}|^{2}}{r_{mm}r_{nn}}+\sum_{m=1}^{M}\frac{|c_{mm}|^{2}}{2r^{2}_{mm}}+\sum_{n-m=1}^{M-1}\frac{|c_{mn}|^{2}}{r_{mm}r_{nn}}, (5)

If the signal 𝐬k\mathbf{s}_{k} is absent, T=0T=0. While if the signal 𝐬k\mathbf{s}_{k} is present, T>0T>0. Hence, TT can be leveraged to distinguish between hypotheses 0\mathcal{H}_{0} and 1\mathcal{H}_{1}.

It should be noted that, in practical scenarios, the standard covariance and complementary covariance matrices (i.e., 𝐑𝐲\mathbf{R}_{\mathbf{y}} and 𝐂𝐲\mathbf{C}_{\mathbf{y}}) can only be computed via a limited number of samples, as given by

𝐑^𝐲=1Kk=1K𝐲k𝐲kHand𝐂^𝐲=1Kk=1K𝐲k𝐲kT.\hat{\mathbf{R}}_{\mathbf{y}}=\frac{1}{K}\sum_{k=1}^{K}\mathbf{y}_{k}\mathbf{y}^{H}_{k}~{}\text{and}~{}\hat{\mathbf{C}}_{\mathbf{y}}=\frac{1}{K}\sum_{k=1}^{K}\mathbf{y}_{k}\mathbf{y}^{T}_{k}. (6)

Therefore, we propose a NCC method based on (5) as

TN=nm=1M1|r^mn|2r^mmr^nn+m=1M|c^mm|22r^mm2+nm=1M1|c^mn|2r^mmr^nn,T_{N}=\sum_{n-m=1}^{M-1}\frac{|\hat{r}_{mn}|^{2}}{\hat{r}_{mm}\hat{r}_{nn}}+\sum_{m=1}^{M}\frac{|\hat{c}_{mm}|^{2}}{2\hat{r}^{2}_{mm}}+\sum_{n-m=1}^{M-1}\frac{|\hat{c}_{mn}|^{2}}{\hat{r}_{mm}\hat{r}_{nn}}, (7)

where TNT_{N} is the test statistic of the proposed NCC method, r^mn\hat{r}_{mn} and c^mn\hat{c}_{mn} denote the elements of 𝐑^𝐲\hat{\mathbf{R}}_{\mathbf{y}} and 𝐂^𝐲\hat{\mathbf{C}}_{\mathbf{y}} at the mmth row and the nnth column, respectively. Given a predefined decision threshold λN\lambda_{N}, if TNλNT_{N}\geq\lambda_{N}, the signal 𝐬k\mathbf{s}_{k} is present (“1\mathcal{H}_{1}” decision); otherwise, signal 𝐬k\mathbf{s}_{k} is not present (“0\mathcal{H}_{0}” 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 KK, the random variable 2KTN2KT_{N} under hypothesis 0\mathcal{H}_{0} approximately follows the central chi-square distribution with 2M22M^{2} degrees of freedom (DoFs), i.e.,

2KTN|0χ2M22,2KT_{N}|\mathcal{H}_{0}\sim\chi_{2M^{2}}^{2}, (8)

where χ2M22\chi_{2M^{2}}^{2} is the central chi-square distribution with 2M22M^{2} DoFs.

Proof:

Under hypothesis 0\mathcal{H}_{0}, the received signal vector 𝐲k\mathbf{y}_{k} only consists of noise vector 𝐰k\mathbf{w}_{k}, i,e., 𝐲k=𝐰k\mathbf{y}_{k}=\mathbf{w}_{k}. Accordingly, 𝐲k𝒞𝒩(𝟎,𝐑w)\mathbf{y}_{k}\sim\mathcal{CN}(\mathbf{0},\mathbf{R}_{w}). Denoting the mmth and nnth element of the received signal vector 𝐲k\mathbf{y}_{k} by ym(k)y_{m}(k) and yn(k)y_{n}(k), respectively. Then ym(k)𝒞𝒩(0,σm2)y_{m}(k)\sim\mathcal{CN}(0,\sigma^{2}_{m}) and yn(k)𝒞𝒩(0,σn2)y_{n}(k)\sim\mathcal{CN}(0,\sigma^{2}_{n}) are independent for mnm\neq n. 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 {r^mm}m=1M\{\hat{r}_{mm}\}_{m=1}^{M}, {r^mn}nm=1M1\{\hat{r}_{mn}\}_{n-m=1}^{M-1}, {c^mm}m=1M\{\hat{c}_{mm}\}_{m=1}^{M} and {c^mn}nm=1M1\{\hat{c}_{mn}\}_{n-m=1}^{M-1} will be derived. Since r^mn\hat{r}_{mn} and c^mn\hat{c}_{mn} are respectively the (m,n)(m,n)th element of 𝐑^𝐲\hat{\mathbf{R}}_{\mathbf{y}} and 𝐂^𝐲\hat{\mathbf{C}}_{\mathbf{y}}. Hence, from (6), we notice that r^mn\hat{r}_{mn} and c^mn\hat{c}_{mn} can be respectively expressed as r^mn=1Kk=1Kym(k)yn(k)\hat{r}_{mn}=\frac{1}{K}\sum_{k=1}^{K}y_{m}(k)y_{n}^{\ast}(k) and c^mn=1Kk=1Kym(k)yn(k)\hat{c}_{mn}=\frac{1}{K}\sum_{k=1}^{K}y_{m}(k)y_{n}(k). Because ym(k)𝒞𝒩(0,σm2)y_{m}(k)\sim\mathcal{CN}(0,\sigma^{2}_{m}) and yn(k)𝒞𝒩(0,σn2)y_{n}(k)\sim\mathcal{CN}(0,\sigma^{2}_{n}), therefore, we obtain 𝔼[ym(k)yn(k)]=0\mathbb{E}[y_{m}(k)y_{n}(k)]=0 and

𝔼[ym(k)yn(k)]={σm2orσn2,n=morm=n;0,others.\displaystyle\mathbb{E}[y_{m}(k)y_{n}^{\ast}(k)]=\begin{cases}\sigma_{m}^{2}~{}\text{or}~{}\sigma_{n}^{2},&n=m~{}\text{or}~{}m=n;\\ 0,&\text{others}.\end{cases} (9)

Using the expression of the statistical variance 𝔻[r]=𝔼[|r|2]|𝔼[r]|2\mathbb{D}[r]=\mathbb{E}[|r|^{2}]-|\mathbb{E}[r]|^{2}and invoking the following formula [14]:

𝔼[r1r2r3\displaystyle\mathbb{E}[r_{1}r_{2}r_{3} r4]=𝔼[r1r2]𝔼[r3r4]+𝔼[r1r3]𝔼[r2r4]\displaystyle r_{4}]=\mathbb{E}[r_{1}r_{2}]\mathbb{E}[r_{3}r_{4}]+\mathbb{E}[r_{1}r_{3}]\mathbb{E}[r_{2}r_{4}]
+𝔼[r1r4]𝔼[r2r3]2𝔼[r1]𝔼[r2]𝔼[r3]𝔼[r4],\displaystyle+\mathbb{E}[r_{1}r_{4}]\mathbb{E}[r_{2}r_{3}]-2\mathbb{E}[r_{1}]\mathbb{E}[r_{2}]\mathbb{E}[r_{3}]\mathbb{E}[r_{4}], (10)

we can get

𝔻[ym(k)yn(k)]={σm4orσn4,n=morm=n;σm2σn2,others.\displaystyle\mathbb{D}[y_{m}(k)y_{n}^{\ast}(k)]=\begin{cases}\sigma_{m}^{4}~{}\text{or}~{}\sigma_{n}^{4},&n=m~{}\text{or}~{}m=n;\\ \sigma_{m}^{2}\sigma_{n}^{2},&\text{others}.\end{cases} (11)

and

𝔻[ym(k)yn(k)]={2σm4or2σn4,n=morm=n;σm2σn2,others.\displaystyle\mathbb{D}[y_{m}(k)y_{n}(k)]=\begin{cases}2\sigma_{m}^{4}~{}\text{or}~{}2\sigma_{n}^{4},&n=m~{}\text{or}~{}m=n;\\ \sigma_{m}^{2}\sigma_{n}^{2},&\text{others}.\end{cases} (12)

In (III-A), r1,r2,r3,r4r_{1},r_{2},r_{3},r_{4} are the complex Gaussian random variables. Therefore, with a sufficiently large KK, by using the central limit theorem, we can obtain

r^mm𝒩(σm2,σm4K),r^mn𝒞𝒩(0,σm2σn2K),\displaystyle\hat{r}_{mm}\sim\mathcal{N}(\sigma_{m}^{2},\frac{\sigma_{m}^{4}}{K}),~{}\hat{r}_{mn}\sim\mathcal{CN}(0,\frac{\sigma_{m}^{2}\sigma_{n}^{2}}{K}), (13)
c^mm𝒞𝒩(0,2σm4K)andc^mn𝒞𝒩(0,σm2σn2K).\displaystyle\hat{c}_{mm}\sim\mathcal{CN}(0,\frac{2\sigma_{m}^{4}}{K})~{}\text{and}~{}\hat{c}_{mn}\sim\mathcal{CN}(0,\frac{\sigma_{m}^{2}\sigma_{n}^{2}}{K}). (14)

Additionally, with the aid of (III-A), it is easy to verify that the random variables {r^mm}m=1M\{\hat{r}_{mm}\}_{m=1}^{M}, {r^mn}nm=1M1\{\hat{r}_{mn}\}_{n-m=1}^{M-1}, {c^mm}m=1M\{\hat{c}_{mm}\}_{m=1}^{M} and {c^mn}nm=1M1\{\hat{c}_{mn}\}_{n-m=1}^{M-1} are independent of each other.

2) From (13) and (14), we can verify that

{r^mmσm2}𝒩(1,1K),{r^mnσmσn,m<n}𝒞𝒩(0,1K),\displaystyle\Big{\{}\frac{\hat{r}_{mm}}{\sigma^{2}_{m}}\Big{\}}\sim\mathcal{N}(1,\frac{1}{K}),\Big{\{}\frac{\hat{r}_{mn}}{\sigma_{m}\sigma_{n}},m<n\Big{\}}\sim\mathcal{CN}(0,\frac{1}{K}), (15)
{c^mmσm2}𝒞𝒩(0,2K),{c^mnσmσn,m<n}𝒞𝒩(0,1K).\displaystyle\Big{\{}\frac{\hat{c}_{mm}}{\sigma^{2}_{m}}\Big{\}}\sim\mathcal{CN}(0,\frac{2}{K}),\Big{\{}\frac{\hat{c}_{mn}}{\sigma_{m}\sigma_{n}},m<n\Big{\}}\sim\mathcal{CN}(0,\frac{1}{K}). (16)

Notice from above that, {r^mmσm2}𝒩(1,1K)\Big{\{}\frac{\hat{r}_{mm}}{\sigma^{2}_{m}}\Big{\}}\sim\mathcal{N}(1,\frac{1}{K}), thereby, for a large KK, we obtain r^mmσm2\hat{r}_{mm}\thickapprox\sigma^{2}_{m} and r^nnσn2\hat{r}_{nn}\thickapprox\sigma^{2}_{n}. Thus

r^mmσmandr^nnσn.\sqrt{\hat{r}_{mm}}\thickapprox\sigma_{m}~{}\text{and}~{}\sqrt{\hat{r}_{nn}}\thickapprox\sigma_{n}. (17)

Taking (17) into (15) and (16) yields

{r^mnr^mmr^nnr^mnσmσn,m<n}𝒞𝒩(0,1K),\displaystyle\Big{\{}\frac{\hat{r}_{mn}}{\sqrt{\hat{r}_{mm}}\sqrt{\hat{r}_{nn}}}\thickapprox\frac{\hat{r}_{mn}}{\sigma_{m}\sigma_{n}},m<n\Big{\}}\sim\mathcal{CN}(0,\frac{1}{K}), (18)
{c^mmr^mmc^mmσm2,m=1,2,,M}𝒞𝒩(0,2K),\displaystyle\Big{\{}\frac{\hat{c}_{mm}}{\hat{r}_{mm}}\thickapprox\frac{\hat{c}_{mm}}{\sigma^{2}_{m}},m=1,2,\ldots,M\Big{\}}\sim\mathcal{CN}(0,\frac{2}{K}), (19)
{c^mnr^mmr^nnc^mnσmσn,m<n}𝒞𝒩(0,1K).\displaystyle\Big{\{}\frac{\hat{c}_{mn}}{\sqrt{\hat{r}_{mm}}\sqrt{\hat{r}_{nn}}}\thickapprox\frac{\hat{c}_{mn}}{\sigma_{m}\sigma_{n}},m<n\Big{\}}\sim\mathcal{CN}(0,\frac{1}{K}). (20)

Moreover, we have {2K|r^mn|2r^mmr^nn=|2Kr^mnr^mmr^nn|2,m<n}χ22\Big{\{}\frac{2K|\hat{r}_{mn}|^{2}}{\hat{r}_{mm}\hat{r}_{nn}}=\Big{|}\frac{\sqrt{2K}\hat{r}_{mn}}{\sqrt{\hat{r}_{mm}}\sqrt{\hat{r}_{nn}}}\Big{|}^{2},m<n\Big{\}}\sim\chi_{2}^{2}, {2K|c^mm|22r^mm2=|2Kc^mm2r^mm|2,m=1,2,,M}χ22\Big{\{}\frac{2K|\hat{c}_{mm}|^{2}}{2\hat{r}_{mm}^{2}}=\Big{|}\frac{\sqrt{2K}\hat{c}_{mm}}{\sqrt{2}\hat{r}_{mm}}\Big{|}^{2},m=1,2,\ldots,M\Big{\}}\sim\chi_{2}^{2} and {2K|c^mn|2r^mmr^nn=|2Kc^mnr^mmr^nn|2,m<n}χ22\Big{\{}\frac{2K|\hat{c}_{mn}|^{2}}{\hat{r}_{mm}\hat{r}_{nn}}=\Big{|}\frac{\sqrt{2K}\hat{c}_{mn}}{\sqrt{\hat{r}_{mm}}\sqrt{\hat{r}_{nn}}}\Big{|}^{2},m<n\Big{\}}\sim\chi_{2}^{2}. Since all the random variables {r^mn}nm=1M1\{\hat{r}_{mn}\}_{n-m=1}^{M-1}, {c^mm}m=1M\{\hat{c}_{mm}\}_{m=1}^{M} and {c^mn}nm=1M1\{\hat{c}_{mn}\}_{n-m=1}^{M-1} are statistically independent, hence, {2K|r^mn|2r^mmr^nn,m<n}\Big{\{}\frac{2K|\hat{r}_{mn}|^{2}}{\hat{r}_{mm}\hat{r}_{nn}},m<n\Big{\}}, {2K|c^mm|22r^mm2,m=1,2,,M}\Big{\{}\frac{2K|\hat{c}_{mm}|^{2}}{2\hat{r}_{mm}^{2}},m=1,2,\ldots,M\Big{\}} and {2K|c^mn|2r^mmr^nn,m<n}\Big{\{}\frac{2K|\hat{c}_{mn}|^{2}}{\hat{r}_{mm}\hat{r}_{nn}},m<n\Big{\}} are approximately independent. Note that the variable nm=1M12K|r^mn|2r^mmr^nn\sum_{n-m=1}^{M-1}\frac{2K|\hat{r}_{mn}|^{2}}{\hat{r}_{mm}\hat{r}_{nn}} is the sum of M(M1)2\frac{M(M-1)}{2} independent χ22\chi_{2}^{2} random variables, thus we have {nm=1M12K|r^mn|2r^mmr^nn}χM(M1)2\Big{\{}\sum_{n-m=1}^{M-1}\frac{2K|\hat{r}_{mn}|^{2}}{\hat{r}_{mm}\hat{r}_{nn}}\Big{\}}\sim\chi_{M(M-1)}^{2}. Similarly, we also can get {m=1M2K|c^mm|22r^mm2}χ2M2\Big{\{}\sum_{m=1}^{M}\frac{2K|\hat{c}_{mm}|^{2}}{2\hat{r}_{mm}^{2}}\Big{\}}\sim\chi_{2M}^{2} and {nm=1M12K|c^mn|2r^mmr^nn}χM(M1)2\Big{\{}\sum_{n-m=1}^{M-1}\frac{2K|\hat{c}_{mn}|^{2}}{\hat{r}_{mm}\hat{r}_{nn}}\Big{\}}\sim\chi_{M(M-1)}^{2}. Based on the above derivations, the variable 2KTN=nm=1M12K|r^mn|2r^mmr^nn+m=1M2K|c^mm|22r^mm2+nm=1M12K|c^mn|2r^mmr^nn2KT_{N}=\sum_{n-m=1}^{M-1}\frac{2K|\hat{r}_{mn}|^{2}}{\hat{r}_{mm}\hat{r}_{nn}}+\sum_{m=1}^{M}\frac{2K|\hat{c}_{mm}|^{2}}{2\hat{r}^{2}_{mm}}+\sum_{n-m=1}^{M-1}\frac{2K|\hat{c}_{mn}|^{2}}{\hat{r}_{mm}\hat{r}_{nn}} follows the chi-squared distribution with 2M22M^{2} DOFs, i.e., 2KTNχ2M222KT_{N}\sim\chi_{2M^{2}}^{2}. Thus the false alarm probability PfP_{f} for the proposed method can be obtained as

Pf\displaystyle P_{f} =Pr{TN>λN|0}\displaystyle=Pr\{T_{N}>\lambda_{N}|\mathcal{H}_{0}\}
=Pr{2KTN>2KλN|0}\displaystyle=Pr\Big{\{}2KT_{N}>2K\lambda_{N}|\mathcal{H}_{0}\Big{\}}
=Pr{χ2M22>2KλN|0}=Qχ2M22(2KλN),\displaystyle=Pr\Big{\{}\chi_{2M^{2}}^{2}>2K\lambda_{N}|\mathcal{H}_{0}\Big{\}}=Q_{\chi_{2M^{2}}^{2}}(2K\lambda_{N}),

where the function Qχ2M22(2KλN)Q_{\chi_{2M^{2}}^{2}}(2K\lambda_{N}) is the tail probability of the chi-squared distribution with 2M22M^{2} DOFs [15]. ∎

Hence, with a predefined PfP_{f}, the corresponding decision threshold λN\lambda_{N} can be given as

λN=Qχ2M221(Pf)2K.\lambda_{N}=\frac{Q_{\chi_{2M^{2}}^{2}}^{-1}(P_{f})}{2K}. (21)

in which Qχ2M221()Q_{\chi_{2M^{2}}^{2}}^{-1}(\cdot) is the inverse function of Qχ2M22()Q_{\chi_{2M^{2}}^{2}}(\cdot).

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 𝐑^𝐲\hat{\mathbf{R}}_{\mathbf{y}}, which requires M(M+1)(K+1)/2M(M+1)(K+1)/2 complex multiplications. The second part is to compute the upper triangular part of the the matrix 𝐂^𝐲\hat{\mathbf{C}}_{\mathbf{y}}, which requires M(M+1)(K+1)/2M(M+1)(K+1)/2 complex multiplications. The third part is to calculate the test statistic TNT_{N}, which requires 3M2+M3M^{2}+M complex multiplications. Hence, the total numbers of required complex multiplications for the proposed method is M2(K+4)+M(K+2)M^{2}(K+4)+M(K+2), and the corresponding complexity is in the order of 𝒪(M2K)\mathcal{O}(M^{2}K).

As analyzed in [13], the complexities of the NC-LAV and NC-HDM methods are respectively in the orders of 𝒪(M2K)\mathcal{O}(M^{2}K) and 𝒪(M2K)+𝒪(M3)\mathcal{O}(M^{2}K)+\mathcal{O}(M^{3}). 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 𝐇\mathbf{H} are drawn independent and identically distributed from 𝒞𝒩(0,1)\mathcal{CN}(0,1), and the noise powers {σm2}m=1M\{\sigma^{2}_{m}\}_{m=1}^{M} are independently drawn from the uniform distribution within [α,α][-\alpha,\alpha] dB, while the noise parameter is set as α=1\alpha=1 in the simulations. Additionally, the iith primary signal si(k)(i=1,,q)s_{i}(k)(i=1,\ldots,q) is assumed to be independent BPSK constellation with different power γi(i=1,,q)\gamma_{i}(i=1,\ldots,q), and the average signal-to-noise ratio (SNR) is defined as 10log(tr(𝐇𝐑𝐬𝐇H)tr(𝐑n))\Big{(}\frac{\text{tr}(\mathbf{H}\mathbf{R}_{\mathbf{s}}\mathbf{H}^{H})}{\text{tr}(\mathbf{R}_{n})}\Big{)}, each simulation result is averaged over 10510^{5} 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 Pf=0.05P_{f}=0.05, where in Fig. 1(a), the simulation parameters are set as q=1q=1, M=4M=4 and K=100K=100; Meanwhile, in Fig. 1(b), the simulation parameters are set as q=3q=3, M=8M=8 and K=200K=200. 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 =11=-11 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 =9=-9 dB and SNR =11=-11 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 PfP_{f} 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 PfP_{f} than its counterparts.

Refer to caption

Refer to caption

Fig.1. Detection probability versus SNR, where (a) q=1q=1, M=4M=4 and K=100K=100; (b) M=8M=8, K=200K=200, q=3q=3 and [γ1,γ2,γ3]=[3,1,0][\gamma_{1},\gamma_{2},\gamma_{3}]=[3,1,0] dB.

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.

Refer to caption

Refer to caption

Fig.2. ROC curves for all compared methods, where (a) q=1q=1, M=4M=4 and K=100K=100; (b) M=8M=8, K=200K=200, q=3q=3 and [γ1,γ2,γ3]=[3,1,0][\gamma_{1},\gamma_{2},\gamma_{3}]=[3,1,0] dB.

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.