- Research
- Open Access

# Spectrum sensing based on cumulative power spectral density

- A. Nasser
^{1, 2}Email author, - A. Mansour
^{1}, - K. C. Yao
^{3}, - H. Abdallah
^{2}and - H. Charara
^{4}

**2017**:38

https://doi.org/10.1186/s13634-017-0475-y

© The Author(s) 2017

**Received: **24 June 2016

**Accepted: **11 May 2017

**Published: **25 May 2017

## Abstract

This paper presents new spectrum sensing algorithms based on the cumulative power spectral density (CPSD). The proposed detectors examine the CPSD of the received signal to make a decision on the absence/presence of the primary user (PU) signal. Those detectors require the whiteness of the noise in the band of interest. The false alarm and detection probabilities are derived analytically and simulated under Gaussian and Rayleigh fading channels. Our proposed detectors present better performance than the energy (ED) or the cyclostationary detectors (CSD). Moreover, in the presence of noise uncertainty (NU), they are shown to provide more robustness than ED, with less performance loss. In order to neglect the NU, we modified our algorithms to be independent from the noise variance.

## Keywords

- Spectrum sensing
- Cumulative power spectral density
- Noise uncertainty
- Rayleigh fading channel
- Cognitive radio

## 1 Introduction

Due to an increasing demand of wireless devices and the limitation of natural spectrum resources, the cognitive radio (CR) has been introduced to optimize the use of the available spectrum [1]. In CR network, primary (PU) and secondary (SU) users can share the same bandwidth. PU is a licensed user, whereas SU is an opportunistic user. To avoid any interference with the PU’s signal, SU can only be active when PU is idle. Therefore, SU should continuously monitor PU status (active or idle).

Many factors (such as low signal to noise ratio (SNR), shadowing, channel fading, etc.) lead to a situation where SU is no longer able to correctly diagnose the status of the PU. To overcome this problem, new techniques for cooperative spectrum sensing (CSS) have been proposed [2, 3]. In the CSS context, several SUs cooperate to reach a decision on the presence of the PU signal; a fusion center (FC) should make the final decision. We can distinguish two schemes of CSS: the soft and the hard combining schemes. In the soft combining scheme, each SU sends its own measured test statistic to the FC who performs a linear combination of all received test statistics and compares the result to a threshold. With the hard combining scheme, each SU compares its own test statistic to a predefined threshold, makes his decision on the PU status, and sends it to the FC, where a final decision is made by combining the decisions of all the SUs using a predefined strategy (such as OR, AND, or a majority strategy).

In the literature, many techniques have been proposed to perform test statistics. Most known methods are energy detection, cysclostationary detection, and waveform detection. The last one requires perfect information about the PU signal [3, 4]. Hence, the use of this method is limited to the case of cooperative relationship between PUs and SUs.

Due to its simplicity and the fact that no prior information about the PU signal is required, the energy detector (ED) is widely used in spectrum sensing. ED consists of measuring the energy of the received signals and comparing it to a predefined threshold based on the known noise variance. Therefore, ED requires an accurate estimation of the noise variance; otherwise, we can face a SNR-wall problem, where the ED becomes incapable to made a robust decision about the PU status, even with a very large observation time [5, 6]. However, many studies have been proposed to enhance the energy detector (ED) performance and to overcome its limitations [5, 7–9].

The cyclostationary features detection (CSD) [10] is also widely used in spectrum sensing. CSD requires the knowledge of the cyclic frequencies of the PU, in addition to a long observation time and computing efforts. In [11], a cooperative CSD is proposed, where each SU performs a single cyclic-frequency detection and sends his decision to a FC to make the final decision. The authors of [12] analyzed theoretically the performance of the algorithm proposed in [11] in multi-path and log-normal channels. In [13], a blind CSD is proposed. This detector performs the spectrum sensing without the knowledge of the cyclic frequencies.

Although energy and cyclostationary detectors are widely used in the field of spectrum sensing, various other methods are also proposed [14–16]. The goodness of fit (GoF) algorithm introduced in [14] compares the empirical distribution of the received samples to a known distribution of the noise (when PU is idle). If the empirical distribution is not compatible with the known distribution of the noise then the PU signal exists. To enhance the performance, [15] extends the algorithm of [14] by using the square of the received samples instead of the samples themselves.

By assuming the oversampling aspect of the baseband received signal (i.e., number of samples per symbols *N*
_{
s
}≥2), the autocorrelation for a non-zero lag only vanishes when the PU signal is absent and the channel is only occupied by a white noise [16]. The corresponding test statistic combines linearly the autocorrelation measures for different non-zero lags before making a decision on the PU status. The performance of this algorithm increases with *N*
_{
s
}.

In this paper, we propose new spectrum sensing detectors based mainly on the cumulative sum of the power spectral density (PSD) of the received signal^{1}. It is known that the PSD of a white noise is flat. However, PSD losses this property with an oversampled PU signal. If the PU is absent, the cumulative sum of the received signal PSD has a close shape to a straight line. Whereas, a curved shape is obtained when PU exists.

To enhance the robustness of our contribution, hard and soft combining schemes are introduced. In those two schemes, the spectrum is divided into two parts: at first, the negative frequency points are considered while the second part deals with the positive frequency points. Hence, two test statistics are calculated based on the cumulative PSD of each part, and they are then combined according to the considered scheme.

The false alarm and detection probabilities are evaluated analytically under Gaussian and Rayleigh fading channels. Our detectors are compared to ED and CSD [8, 16]. Our detectors present a better performance than the energy detector, even at *N*
_{
s
}=2 samples per symbol, where the CSD detector provides a poor performance relatively to ED. Furthermore, our detectors are less sensitive to the noise uncertainty than ED. In particular, we demonstrate that our detectors can be modified to become independent from the noise variance. This case represents an important advantage in real scenarios.

The rest of this paper is organized as follows. In Section 2, the system model and the spectrum sensing hypothesis are presented, in addition to an overview of the PSD and its estimation. Our proposed detectors based on the cumulative sum of the PSD are discussed in Section 3. Section 4 provides an analytic study on the statistical distributions of the test statistics as well as the calculus of the false alarm and detection probabilities. In Section 5, the probability of detection over Rayleigh flat-fading channel is provided. The numerical results of our detectors will be presented in Section 6. The effects of the noise uncertainty problem on our detectors are shown in Section 7. To overcome the noise uncertainty problem, this section presents modified versions of our detectors which are independent of the noise variance. At the end, a conclusion and perspective section of our work is provided.

## 2 System model and generality

*s*(

*n*), can be modeled as follows:

*b*
_{
m
} are the symbols to be transmitted; *g*(*n*) is the shaping window; *N*
_{
s
} satisfies the Nyquist criterion; \(N_{s}=\frac {F_{s}}{B}\geq 2\) samples per symbol (sps), where *F*
_{
s
} is the sampling frequency and *s*
_{
p
}(*n*) and *s*
_{
q
}(*n*) are respectively the real and imaginary parts of *s*(*n*). *s*(*n*) has a bandwidth *B* and an even power spectral density (PSD). *s*(*n*) is assumed to be complex-valued zero mean unknown deterministic^{2} signal [11, 12, 17–19].

*H*

_{0}, the PU is absent, whereas under

*H*

_{1}PU exists.

where *h* is the complex channel gain. *w*(*n*) is \(\mathcal {N}(0,\sigma _{w}^{2})\), where \(\mathcal {N}(m,V)\) stands for a normal distribution of a mean *m* and a variance *V*. Further, *w*(*n*)=*w*
_{
p
}(*n*)+*jw*
_{
q
}(*n*) is an *i*.*i*.*d* complex circular symmetric, *i*.*e*.,

*E*[

*w*

^{2}(

*n*)]=0 and the real part,

*w*

_{ p }(

*n*), and the imaginary part,

*w*

_{ q }(

*n*), of

*w*(

*n*) are independent Gaussian processes with equal variance.

*E*[.] stands for the expectation. Without loss of generality, we assume that

*s*(

*n*) is a unit power signal. In this case, the signal to noise ratio (SNR),

*γ*, is defined as follows:

A wrong decision about the channel status can affect either the PU transmission or the efficient use of the channel. In fact, a missed detection can cause a harmful interference by the transmission of the SU in the same band of the PU. A false alarm, however, decreases the profit of the opportunity of the channel. Therefore, the probability of detection (*p*
_{
d
}) should be increased as much as possible, by keeping the probability of false alarm (*p*
_{
fa
}) low. Neyman-Person’s detection method consists in a trade-off between a high *p*
_{
d
} and a low *p*
_{
fa
}.

### 2.1 Power spectral density

*P*

_{ x }(

*k*), of a wide sense stationary signal

*x*(

*n*) is the Fourier transform (\(\mathcal {FT}\)) of its autocorrelation function,

*r*

_{ xx }(

*m*) [20]:

*w*(

*n*) becomes

where *δ*(*m*) is Kronecker’s function. Based on Eq. (7), the PSD of the white noise, *P*
_{
w
}(*k*), becomes real, even and constant over the frequency band [−*B*;*B*], with an amplitude \(\sigma _{w}^{2}\). It is obvious that the cumulative sum of the PSD becomes a straight line, with a slope \(\sigma _{w}^{2}\).

*s*(

*n*) is a cyclostationary signal characterized by its cyclic spectral density (CSD), \(S_{s}^{\alpha }(k)\) [13, 18]:

*α*is a cyclic frequency of

*s*(

*n*), \(S_{N}(k)=\mathcal {FT}\left \{s(n)\right \}\) is the \(\mathcal {FT}\) of

*N*received samples of

*s*(

*n*)

^{3}and

*R*(

*α*,

*m*) is the cyclic autocorrelation function of

*s*(

*n*) and can be defined as [18, 19]:

*P*

_{ s }(

*k*), of

*s*(

*n*) can be evaluated for null cyclic frequency (i.e.,

*α*=0),

Due to the fact that the PU signal is not an *i*.*i*.*d*. signal (i.e. *R*(0,*m*) is not a Kronecker’s function), then its PSD, *P*
_{
s
}(*k*), should be not constant on [−*B*;*B*]. Based on this fact, the distinguish between *H*
_{0} and *H*
_{1} can be realized using the shape of the cumulative sum of PSD.

### 2.2 Estimation of the power spectral density

*y*(

*n*) can be estimated by its periodogram as follows [20]:

*Y*(

*k*) is the discrete Fourier transform (DFT) of the signal

*y*(

*n*) with

*N*samples:

Therefore, the estimated PSD of the signal is related to the modulus of its DFT.

Since *w*(*n*) is a circular symmetric process, then its DFT *W*(*k*) becomes also a zero mean circular symmetric process [21–23].

## 3 Cumulative power spectral density-based detector

*ψ*

_{ y }(

*k*), of the received signal

*y*(

*n*) is defined, over a frequency interval

*I*=[

*v*;

*l*] ∀

*k*∈

*I*as follows :

where \(\hat {P}_{y}(u)\) is the estimated PSD of *y*(*n*) using Eq. (11). Unlike ED, which makes the sum of energy on all frequency points of PSD, CPSD makes the sum of the energy on a given frequency points interval. The sense of variation of CPSD will be tested in order to make a decision on the PU signal existence as detailed below.

*ψ*

_{ w }(

*k*),

*v*≤

*k*≤

*l*, of

*w*(

*n*) can be found as follows:

The last value shows that *ψ*
_{
w
}(*k*) increases linearly on the frequency interval [*v,l*] with *k* till its highest value \((l-v+1)\sigma _{w}^{2}\).

*Γ*(

*k*), of

*y*(

*n*) by

*H*

_{0},

*Γ*(

*k*) still increase to one. Thus, under

*H*

_{0}and thanks to the flat PSD of

*w*(

*n*), the shape of

*Γ*(

*k*) becomes closed to a straight line

*R*(

*v,l*;

*k*).

Under *H*
_{1}, this constraint is not satisfied, since the PSD of *s*(*n*) is not a constant, and *Γ*(*k*) has higher values than the one obtained under *H*
_{0} due to the additional power of *s*(*n*).

*Γ*(

*k*) under

*H*

_{0}and

*H*

_{1}for rectangular and raise-cosine (roll-off factor = 0.5) pulse shaping filters respectively, for various values of

*N*

_{ s }and different SNR. The signal modulation is 16-QAM, and the number of used samples is

*N*=10000. As shown in Figs. 1 and 2, the gap between the normalized CPSD shape under

*H*

_{1}and that under

*H*

_{0}increases with the SNR for both considered pulse shaping filters. In addition, the non-linearity of the CPSD shapes grows with

*N*

_{ s }. Therefore, we define a test statistic

*T*as the difference between

*Γ*(

*k*) and the reference straight line

*R*(

*v,l*;

*k*). Accordingly, we introduce two detectors:

- 1.
*T*_{ p }: This detector is based on the CPSD,*Γ*_{ p }(*k*), of \(\hat {P}_{y}(k)\) for positive frequency points(i.e.,\(\ 1\leq k \leq \frac {N}{2}\)), in this case, the corresponding CPSD,*ψ*_{ p }(*k*), is defined as follows:$$\begin{array}{*{20}l} \psi_{p}(k)=\sum\limits_{u=1}^{k} \hat{P}_{y}(u) \end{array} $$(17)Accordingly, the normalized CPSD,*Γ*_{ p }(*k*) becomes$$\begin{array}{*{20}l} \Gamma_{p}(k)&=\frac{\psi_{p}(k)}{\left(\frac{N}{2}-1+1\right)\sigma_{w}^{2}}\\ &=\frac{2}{N\sigma_{w}^{2}}\sum\limits_{u=1}^{k} \hat{P}_{y}(u) \\ &=\frac{2}{N^{2}\sigma_{w}^{2}}\sum\limits_{u=1}^{k}|Y(u)|^{2} \end{array} $$(18)and the reference straight line \(R\left (1,\frac {N}{2};k\right)\) is obtained by$$\begin{array}{*{20}l} R\left(1,\frac{N}{2};k\right)=\frac{k-1+1}{\frac{N}{2}-1+1}=\frac{2k}{N} \end{array} $$(19)*T*_{ p }detector aims at finding the difference between*Γ*_{ p }(*k*) and the corresponding reference shape \(R\left (1,\frac {N}{2};k\right)\):$$\begin{array}{*{20}l} T_{p}&=\sum\limits_{k=1}^{\frac{N}{2}} \left(\Gamma_{p}(k)-R\left(1,\frac{N}{2};k\right)\right) \\ T_{p}&=\sum\limits_{k=1}^{\frac{N}{2}} \left(\Gamma_{p}(k)-\frac{2k}{N}\right) \\ &=\sum_{k=1}^{\frac{N}{2}} \Gamma_{p}(k)-\frac{N+2}{4} \end{array} $$(20) - 2.
*T*_{ a }: This detector is based on the CPSD of all frequencies of*y*(*n*) (i.e., \(-\frac {N}{2}+1\ \leq \ k \leq \ \frac {N}{2}\)), similarly to*T*_{ p }:

*Γ*

_{ a }(

*k*) can be found as follows:

### 3.1 Proposed combining detectors

*T*

_{ or }, aims at exploiting all the frequency points of the signal

*y*(

*n*), by applying two test statistics: the first one tests the shape of the CPSD for positive frequency points (which is

*T*

_{ p }), and

*T*

_{ n }tests the CPSD shape of the CPSD of the symmetric of

*P*

_{ y }(

*k*) part standing for the negative frequency points (i.e.,\(\ -\frac {N}{2}+1\ \leq \ k\ \leq \ 0\)).

*Γ*

_{ n }(

*k*) in this case is given by

Since *P*
_{
s
}(*k*) is symmetric and deterministic (as *s*(*n*) is deterministic) and the components of *W*(*k*) are *i*.*i*.*d*. (as it is shown in Section 4.1.1); therefore *T*
_{
p
} and *T*
_{
n
} become independent and have same mean and variance.

*T*

_{ p }and

*T*

_{ n }make their own decisions,

*T*

_{ or }, acting as hard cooperative detector, processes those two decisions using an OR rule.

where \(D_{T_{p}}\) and \(D_{T_{n}}\) are the detection results of *T*
_{
p
} and *T*
_{
n
} respectively.

*T*

_{ av }, performs the average,

*P*

_{ av }, between the positive frequency PSD and the symmetric of the negative frequency PSD of the received signal. CPSD is then performed on

*P*

_{ av }. The averaging process smooth the PSD, since

*P*

_{ s }(

*k*) is symmetric, and the components of \(\hat {P}_{w}(k)\) are independent as shown in Section 4.

*T*

_{ av }can be considered as a soft combining detector of

*T*

_{ p }and

*T*

_{ n }.

## 4 Statistical analysis

Distributions of test statistics are essential in order to find analytically the probability of false alarm *p*
_{
fa
} and the detection probability *p*
_{
d
}. *T*
_{
p
} and *T*
_{
a
} have the same statistical distribution since *W*(*k*) is *i*.*i*.*d*. and *S*(*k*) is deterministic as *s*(*n*) is assumed to be deterministic. In the following, we develop the distribution of *T*
_{
p
} under *H*
_{0} and *H*
_{1} over a Gaussian channel, where the channel effect *h* is assumed to be constant. Similarly, the distribution of *T*
_{
a
} can be found. *T*
_{
or
} made its decision by applying the logical OR on the decisions of *T*
_{
p
} and *T*
_{
n
} which have the same distribution.

### 4.1 False alarm and detection probabilities of *T*
_{
p
}

*T*

_{ p }depends on \({\sum \nolimits }_{k=1}^{\frac {N}{2}} \Gamma _{p}(k)\) as presented in Eq. (20). A simplification of the term \({\sum \nolimits }_{k=1}^{\frac {N}{2}} \Gamma _{p}(k)\) can be obtained as follows (see Appendix 1):

#### 4.1.1 False alarm probability of *T*
_{
p
}

*H*

_{0}, the test statistic

*T*

_{ p }is only related to the noise

*w*(

*n*). Using Eq. (29),

*T*

_{ p }can be written as follows:

Being the discrete Fourier transform of a white noise *w*(*n*), *W*(*k*) asymptotically follows a normal distribution since it is the sum of independent terms. It is known that two Gaussian variables are independent if they are uncorrelated [22]. As *E*[*W*(*k*)*W*
^{∗}(*k*−*m*)]=*E*[*W*(*k*)]*E*[*W*
^{∗}(*k*−*m*)]=0 (see Appendix (2)), then *W*(*k*) becomes *i*.*i*.*d*.

*T*

_{ p }tends towards \(\mathcal {N}(\mu _{0},V_{0})\) under

*H*

_{0}. In this case, the probability of false alarm \(p_{fa}^{p}\) of

*T*

_{ p }can be found as follows:

*Q*(.) is the

*Q*-function

^{4}, and

*λ*is the threshold of comparison. Since \(E\left [|W(k)|^{2}\right ]\ =N\sigma _{w}^{2}\) and based on Eq. (30), we can evaluate

*μ*

_{0}as follows:

*V*

_{0}, of

*T*

_{ p }becomes (see Appendix 4)

#### 4.1.2 Probability of detection of *T*
_{
p
}

*H*

_{1},

*Y*(

*k*)=

*hS*(

*k*)+

*W*(

*k*), then Eq. (29) becomes as follows:

*S*(

*k*) is deterministic and the terms of

*W*(

*k*) are independent, the distribution of

*T*

_{ p }under

*H*

_{1}tends also towards \(\mathcal {N}(\mu _{1},V_{1})\). In this case, the probability of detection \(p_{d}^{p}\), of

*T*

_{ p }can be found as follows:

*μ*

_{1}and

*V*

_{1}should be evaluated in order to find \(p_{d}^{p}\). Under

*H*

_{1}, |

*Y*(

*k*)|

^{2}becomes

*hS*(

*k*)=

*DFT*{

*hs*(

*n*)} and

*Re*{

*X*} is the real part of

*X*. The mean value of

*T*

_{ p }under

*H*

_{1}can be found as follows (see Appendix 3):

where \(b=\frac {2}{N^{2}}\sum _{k=1}^{\frac {N}{2}}(\frac {N}{2}-k+1)|S(k)|^{2}\), and *γ* is the SNR as defined by Eq. (4).

*H*

_{1}, the variance

*V*

_{1}is given by the following equation (see Appendix 5):

where \(c=\frac {8}{N^{3}}{\sum \nolimits }_{k=1}^{\frac {N}{2}} \left (\frac {N}{2}-k+1\right)^{2}|S(k)|^{2}\).

*T*

_{ a }is based on similar idea to

*T*

_{ p }, but it covers the

*N*frequency points instead of just positive frequency points (\(\frac {N}{2}\) points). Since

*W*(

*k*) is

*i*.

*i*.

*d*. and

*S*(

*k*) is deterministic, then by following the same process for \(p_{fa}^{p}\) and \(p_{d}^{p}\), the probability of false alarm \(p_{fa}^{a}\) and the probability of detection \(p_{d}^{a}\) of the detector

*T*

_{ a }can be found as follows:

where \(\mu _{0}^{a}=0\); \( V_{0}^{a}=\frac {N}{3}+\frac {1}{2}+\frac {1}{6N}\); \(\mu _{1}^{a}=b_{a}\gamma \), where \(b_{a}=\frac {1}{N^{2}}\sum _{k=1}^{N}(N-k+1)|S(k)|^{2}\), and \(V_{1}^{a}=V_{0}^{a}+c_{a}\gamma \), where \(c_{a}=\frac {2}{N^{3}}\sum _{k=1}^{N} (N-k+1)^{2}|S(k)|^{2}\).

### 4.2 Probabilities of *T*
_{
or
}

*T*

_{ or }applies the OR rule between the decisions of

*T*

_{ p }and

*T*

_{ n }, then

*T*

_{ or }can be considered as a hard cooperative detector of these two detectors. Since

*T*

_{ p }and

*T*

_{ n }are independent and have the same statistics as we defined previously, the probability of false alarm \(p_{fa}^{or}\) and the probability of detection \(p_{d}^{or}\) of

*T*

_{ or }can be found as follows [2]:

### 4.3 Probabilities of *T*
_{
av
}

*T*

_{ av }can be developed following similar steps as Eq. (30).

Under *H*
_{0}, *Y*(*k*)=*W*(*k*), then *T*
_{
av
} becomes the sum of independent terms. Based on CLT, *T*
_{
av
} asymptotically follows \(\mathcal {N}(\mu _{0}^{av},V_{0}^{av})\) under *H*
_{0}.

Under *H*
_{1}, *Y*(*k*)=*hS*(*k*)+*W*(*k*) and *S*(*k*) is deterministic, so *T*
_{
av
} is still following a normal distribution: \(\mathcal {N}(\mu _{1}^{av},V_{1}^{av})\) under *H*
_{1}.

*T*

_{ av }are expressed as follows:

Since *W*(*k*) is *i*.*i*.*d*. and *P*
_{
s
}(*k*) is even, \(\mu _{0}^{av},V_{0}^{av}\), \(\mu _{1}^{av}\), \(V_{1}^{av}\) can be found by following similar steps to *μ*
_{0}, *V*
_{0}, *μ*
_{1} and *V*
_{1}, we can find that \(\mu _{0}^{av}=\mu _{0}\), \(V_{0}^{av}=\frac {V_{0}}{2}\), \(\mu _{1}^{av}=\mu _{1}\), and \(V_{1}^{av}=\frac {V_{1}}{2}\).

*γ*=−12 dB,

*N*=1000 samples, and

*N*

_{ s }=4 sps.

As shown in Fig. 3
a, *T*
_{
av
} is the most efficient detector for both considered shaping filters. For the simulations of Section 6 under Gaussian channel, only *T*
_{
av
} and *T*
_{
or
} are compared to other well-known detectors. The rest of simulations in this paper are done with a rectangular pulse-shaping filter.

## 5 Probability of detection over Rayleigh fading channel

*h*. The distribution of the SNR,

*γ*, in a Rayleigh channel is given by [21]:

where \(\bar {\gamma }\) is the average SNR.

*p*

_{ dr }, is found by averaging the probability of detection,

*p*

_{ dg }under Gaussian channel with respect to

*f*

_{ γ }(

*γ*).

Concerning our detectors, *T*
_{
p
}, *T*
_{
a
}, and *T*
_{
av
}, their detection probabilities over Rayleigh fading channel can be derived similarly, since they have a similar probability of detection: \(p=Q(\frac {\lambda -\delta \gamma }{V_{H_{0}} + \beta \gamma })\), where *δ*, \(V_{H_{0}}\), and *β* are constants.

Hereinafter, we only derive \(p_{dr}^{p}\), the detection probability of *T*
_{
p
} over a Rayleigh channel. Once \(p_{dr}^{p}\) is derived, \(p_{dr}^{a}\) and \(p_{dr}^{av}\), the probability of detection of *T*
_{
a
} and *T*
_{
av
}, can be easily found.

*Q*-function, \(g(\gamma)=\frac {\lambda -b\gamma }{\sqrt {V_{0}+c\gamma }}\), around

*γ*

_{0}=

*λ*/

*b*as follows (see Appendix 6):

where *g*
_{1}(*γ*) is the first-order Taylor series approximation of *g*(*γ*).

*Q*(−

*x*)=1−

*Q*(

*x*), the integral of Eq. (50) becomes

*N*/2 used in

*T*

_{ p }by

*N*used in

*T*

_{ a }. Similarly to \(\hat {p}_{dr}^{p}\),the approximation \(\hat {p}_{dr}^{av}\) of \(p_{dr}^{av}\) can be derived as follows:

where \(\theta _{av}=-\frac {b}{\sqrt {V_{0av}+\frac {c\lambda }{2b}}}\).

*γ*
_{0} is not modified in the expression of \(\hat {p}_{dr}^{av}\), since *T*
_{
p
} and *T*
_{
av
} have the same mean under *H*
_{1}.

*T*

_{ or }under Gaussian channel is a non-linear combination of the probability of detection of

*T*

_{ p }and

*T*

_{ n }. Over a Rayleigh channel, the fading coefficient,

*h*, is the same for

*T*

_{ p }and

*T*

_{ n }, \(p_{dr}^{or}\) of

*T*

_{ or }becomes

As there is no analytic solution of Eq. (54), we solve it in numerical way.

*T*

_{ av }and

*T*

_{ or }both achieve the best performance among the proposed detectors, thus they will be compared to the well-known ED and CSD under Rayleigh channel.

## 6 Performance evaluation

In this section, we compare the performance of our detectors to that of the energy detector (ED) [8] and the cyclostationary detector (CSD) [10], under Gaussian and Rayleigh channels. Throughout the upcoming simulations, A 16-QAM baseband-modulated PU signal with a rectangular pulse-shaping filter is considered.

### 6.1 Performance analysis over Gaussian channel

*N*

_{ s }. Simulations are done using

*N*=1500 samples and

*γ*=−12 dB. According to that figure, the performance increases with

*N*

_{ s }. For the limiting case, i.e., when

*N*

_{ s }=2 sps, CSD shows a poor performance relatively to

*T*

_{ av },

*T*

_{ or }, and ED, while

*T*

_{ av }outperforms all other detectors. However,

*T*

_{ av }and

*T*

_{ or }outperform ED and CSD for different values of

*N*

_{ s }.

*p*

_{ fa }=0.1. The number of samples is fixed

*N*=1000 samples, and various values are assigned for

*N*

_{ s }.

*T*

_{ av }and

*T*

_{ or }reach higher probabilities of detection than ED and CSD for similar SNR and different values of

*N*

_{ s }. In addition, increasing

*N*

_{ s }leads to enhancing the performance of

*T*

_{ or },

*T*

_{ av }, and CSD. For example,

*T*

_{ av }reaches

*p*

_{ d }=0.9 at SNR ≃−7 dB for

*N*

_{ s }=2 sps, while the same probability of detection is reached for SNR ≃−9 dB and SNR ≃−10 dB at

*N*

_{ s }=4 sps and

*N*

_{ s }=8 sps respectively.

### 6.2 Performance analysis over Rayleigh channel

*N*

_{ s }=4 and

*N*

_{ s }=8 sps, with

*N*=1000 samples and an average SNR of −5 dB.

Over Rayleigh fading channel, *T*
_{
av
} and *T*
_{
or
} are still outperforming ED and CSD. The same fading suffered by the negative and the positive frequency parts of PSD affects the performance of our detectors. This fact makes the performances of ED and CSD closed to the proposed detectors, as shown in Fig. 7, where the gap of performance among our detectors, ED and CSD becomes smaller comparing it to a Gaussian channel.

### 6.3 Complexity analysis

*T*

_{ p }needs \(\frac {N}{2}\) operations to obtain |

*Y*(

*k*)|

^{2}and \(\frac {N}{2}\) multiplication operations to evaluate the product \(\left (\frac {N}{2}-k+1\right)|Y(k)|^{2}\). Moreover,

*T*

_{ p }performs

*N*addition operations: \(\frac {N}{2}\) operations to calculate \(\left (\frac {N}{2}-k+1\right)\), \(\frac {N}{2}-1\) operations to compute the overall sum and, at the end, one addition operation is required to subtract \(\frac {N+2}{4}\). Furthermore, to compute the

*Y*(

*k*), we need

*Nlog*

_{2}(

*N*) operations using the fast Fourier transform (FFT) algorithm. The overall number of operations needed by

*T*

_{ p }is \(\mathcal {C}(T_{p})\):

*T*

_{ or }, we have to previously find

*T*

_{ p }and

*T*

_{ n }. Since those two test statistics have the same complexity, therefore, the complexity of

*T*

_{ or }becomes the double of that of

*T*

_{ p }except for the calculus of the FFT which should be evaluated once. Then the required number of operations of

*T*

_{ or }, \(\mathcal {C}(T_{or})\), becomes

*T*

_{ av }, we can find the corresponding number of operations, \(\mathcal {C}(T_{or})\), similarly to

*T*

_{ or }:

*N*operations of multiplication and

*N*−1 for addition:

where *L* is an odd number and stands for the length for the unit window used in the detection process of CSD [10].

According to Eqs. (56) and (57), the complexity *T*
_{
or
} and *T*
_{
av
} is independent of the number of samples per symbol *N*
_{
s
}, contrary to CSD where the complexity depends on *N*
_{
s
} as shown in Eq. (59). As shown previously, increasing the oversampling rate leads to obtain a robust performance for CSD, *T*
_{
or
} and *T*
_{
av
}, while the performance of ED is not affected by the oversampling rate.

*p*

_{ fa };

*p*

_{ d })=(0.1;0.9) under a Gaussian channel. As shown in Fig. 8 a,

*T*

_{ or }and

*T*

_{ av }need a number of samples less than that of ED and CSD, in order to reach the target probabilities. In addition, the required number of samples decreases with an increasing

*N*

_{ s }. Figure 8 b shows the number of performed operations corresponding to the number of required samples given in Fig. 8 a. The complexity of

*T*

_{ or }and

*T*

_{ av }decreases if

*N*

_{ s }increases due to the fact that the number of required samples decreases with an increasing

*N*

_{ s }. Contrariwise, the complexity of CSD grows with

*N*

_{ s }even if the total number of samples decreases, this is because the complexity of CSD depends on

*N*

_{ s }. On the other side, our proposed detectors are slightly more complicated than ED.

To summarize, ED is less complicated than the proposed detectors. However, *T*
_{
av
} and *T*
_{
or
} require shorter observation time to fulfill the equivalent performance of ED and CSD.

## 7 Robustness of our proposed detectors under noise uncertainty

Due to many factors (such as thermal noise, ambient interference, receiver non-linearity, etc.), the variance of the white noise cannot be estimated accurately. This fact introduces the noise uncertainty (NU) problem which prevents the detector from reaching a target (*p*
_{
fa
},*p*
_{
d
}) even with a large observation time. According to Eq. (15), the noise variance should be pre-estimated in order to perform the normalization. That means our proposed detectors are sensitive to the estimation of the noise variance. In this section, the impact of the NU on the robustness of our proposed detectors is evaluated.

*r*≥1 stands for the NU factor. The distribution of \(\hat {\sigma }_{w}^{2}\), \(f_{\hat {\sigma }_{w}^{2}}(\hat {\sigma _{w}^{2}})\), is assumed to be uniform in a logarithmic scale red [26].

where \(s=10\log _{10}(\sigma _{w}^{2})\), \(\hat {s}=10\log _{10} (\hat {\sigma }_{w}^{2})\), and *ρ*=10 log10(*r*).

In a conventional detection mechanism, a suitable threshold *λ* is fixed according to a target *p*
_{
fa
}. In our proposed detectors, the choice of *λ* depends on setting the estimated value of the noise variance and the observation time (i.e. the number of the received samples). A wrong estimation of \(\sigma _{w}^{2}\) may lead to an inappropriate *λ*. This fact increases the false alarm rate and deteriorates the spectrum sensing performance.

*p*

_{ fa }with

*ρ*is illustrated for the proposed detectors and the conventional ED. All considered detectors are assumed to have

*p*

_{ fa }=0.1 when no NU exists (i.e.

*ρ*=0), then the threshold of each detector is chosen according to

*p*

_{ fa }=0 with a perfect estimation of the noise variance. Figure 9 shows that the

*p*

_{ fa }of ED ia higher than the ones of the proposed detectors. Indeed, our detectors exploit both the energy and the CPSD shape of the received signal unlike ED which exploits only the energy. On the other hand,

*T*

_{ av }and

*T*

_{ a }have the same

*p*

_{ fa }as these two detectors are based on linear combination of |

*W*(

*k*)|

^{2}which is

*i*.

*i*.

*d*..

*T*

_{ or }has a superior

*p*

_{ fa }than

*T*

_{ p }since these two detectors are related to each other by a non-linear Eq. (41).

*Δ*

*p*

_{ d }=

*p*

_{ d }(0)−

*p*

_{ d }(

*ρ*) where

*p*

_{ d }(0) stands for the case where there is no NU, and

*p*

_{ d }(

*ρ*) stands for probability of detection for the case where NU is equal to

*ρ*dB. Figure (10) presents

*Δ*

*p*

_{ d }of our detectors and ED for

*p*

_{ fa }=0.1,

*N*=1000 samples, SNR of -10 dB, and

*N*

_{ s }=3 sps. As shown in this figure, our detectors are less sensitive to the noise uncertainty than the energy detector for

*p*

_{ fa }=0.1. We observe that

*T*

_{ a }is most affected among the proposed detectors.

*T*

_{ av }and

*T*

_{ or }have the same detection loss since they both are related to both

*T*

_{ p }and

*T*

_{ n }, which exhibit the same NU.

**Spectrum sensing based on self-normalized CPSD:**As discussed previously, the normalization by the noise variance (Eq. (15)) leads to a possible NU problem. In order to avoid this problem, a new model for the proposed detectors is introduced. Instead of normalizing the CPSD by the mean value of the last term of

*ψ*

_{ w }(

*k*), the CPSD is normalized using the last term. The self-normalized CPSD of the received signal,

*y*(

*n*), is defined as follows:

For \([v;l]=\left [-\frac {N}{2}+1;\frac {N}{2}\right ]\), \(\psi _{y}\left (\frac {N}{2}\right)=\frac {1}{N}{\sum \nolimits }_{k=-\frac {N}{2}+1}^{\frac {N}{2}}|Y(k)|^{2}\) becomes the estimated energy of the received signal.

Such a normalization makes *η*
_{
y
}(*k*) not vulnerable to the NU as its calculus does not depend on the estimation of the noise variance (as presented in Eq. (62)), and its distribution and its statistical parameters (mean and variance) are also independent of the noise variance (see Appendix 7).

This normalization is equivalent to a scaling and does not change the shape form of the CPSD.

*η*

_{ y }(

*k*) under

*H*

_{0}and

*H*

_{1}and a SNR =0 dB for various values of

*N*

_{ s }. We have under

*H*

_{0}a shape like a straight line, but a curved shape under

*H*

_{1}. As shown in this figure, the difference between

*η*

_{ y }(

*k*) and the straight line increases as

*N*

_{ s }increases, which means the detection becomes more reliable with the increasing of

*N*

_{ s }.

*η*

_{ y }(

*k*) with respect to the reference straight line, the decision about the presence of the PU signal is made by comparing the

*η*

_{ y }(

*k*) shape to the reference line shape. For that reason, the dissimilarity between the CPSD and the reference straight line is computed (see Eqs. (63)–(66)). Similarly to the detectors

*T*

_{ p },

*T*

_{ a },

*T*

_{ or }, and

*T*

_{ av }, we define the new detector model based on the self-normalization detectors: \(T_{p}^{s}\), \(T_{a}^{s}\), \(T_{or}^{s}\), and \(T_{av}^{s}\) as follows respectively:

*N*

_{ s }=4 sps, SNR of -10 dB, and

*N*=1000 samples under Gaussian and Rayleigh flat-fading channels. For a NU =0 dB,

*T*

_{ av }and

*T*

_{ or }outperform \(T_{av}^{s}\) and \(T_{or}^{s}\) respectively for both Gaussian and Rayleigh channels. Beside that, when the NU grows, the performance of \(T_{av}^{s}\) and \(T_{or}^{s}\) is not affected, whereas the detectors

*T*

_{ av },

*T*

_{ or }, and ED suffer a performance degradation and become less robust than the self-normalization detectors, as shown in Figs. 12 b, c and 13 b, c. However,

*T*

_{ av }and

*T*

_{ or }have a superior performance relative to ED for different values of

*ρ*.

## 8 Conclusions

In this paper, we proposed spectrum sensing detectors based on the cumulative power spectral density (CPSD). Our proposed detectors verify the linearity of the CPSD shape of the received signal.

Hard and soft schemes are used to combine the CPSD measures, which are derived based on the two symmetric parts of the power spectral density. False alarm and detection probabilities are derived analytically under both Gaussian and Rayleigh flat-fading channels. Our simulation results show the performance superiority of our detectors comparing to classic detectors such as the energy and the cyclostationary detectors.

In addition, simulation results show that the proposed detectors are less affected by the noise uncertainty than the energy detector. However, to avoid the impact of the noise uncertainty, the measured CPSD is normalized by the estimated energy of the received signal. By doing this, we make our detectors independent from the noise variance.

In a future work, we will enhance the power spectral density estimator and extend our algorithms to deal with multiple antennas spectrum sensing problem.

## 9 Endnotes

^{1} This work was presented in part as a book chapter in Springer book [27]

^{2} According to [18] and [19], almost-periodic signals can be considered as deterministic in a fraction of time (i.e., for our application, this is the time of sensing). As the linear modulated signal *s*(*n*) is almost cyclostationary signal according to [19], then it is almost-periodic [18, 19] and consequently it can be considered as deterministic during a period of spectrum sensing. On the other hand, in [28] the author motivates the use of the deterministic assumption of the cyclostationary signals in a fraction of time while the purely stationary noise signals (do not have any cyclic features) are considered random.

^{3} for simplicity, we refer to *S*
_{
N
}(*k*) by only *S*(*k*) in the forthcoming sections

^{4}
\(Q(x)=\frac {1}{\sqrt {2\pi }}\int _{x}^{+\infty }{e^{\frac {-t^{2}}{2}}dt}\) [22]

## 10 Appendix

## 11 Simplification of Eq. (20)

## 12 Autocorrelation of the DFT of *W*(*k*)

*W*(

*k*),

*r*

_{ WW }(

*m*).

*w*(

*n*) is

*i*.

*i*.

*d*.,

*r*

_{ WW }(

*m*) becomes

*m*∈ZZ

^{∗}, we obtain

## 13 The mean of *T*
_{
p
} under *H*
_{1}

## 14 Variance of *T*
_{
p
} under *H*
_{0}

*μ*

_{0}=

*E*[

*T*

_{ p }]=0, using Eq. (30), the variance

*V*

_{0}can be written as follows:

Since *W*(*k*) is Gaussian and *i*.*i*.*d*. then:

*W*(

*k*) is zero:

*E*[

*W*

^{2}(

*k*)]=0 because

*W*(

*k*) is circular symmetric Gaussian, then

*k*

_{1}≠

*k*

_{2}:

*V*

_{0}becomes

## 15 Variance of *T*
_{
p
} under *H*
_{1}

*V*

_{1}, of

*T*

_{ p }under

*H*

_{1}.

*A*

_{2}=0 because

Since *W*
_{
p
}(*k*) and *W*
_{
q
}(*k*) are independent and \( E\left [W_{p}(k_{1})W^{2}_{p}(k_{2})\right ]=E\left [W^{2}_{q}(k_{1})W_{q}(k_{2})\right ]=0 \forall k_{1} \) and *k*
_{2}, since *W*
_{
q
}(*k*) and *W*
_{
p
}(*k*) are Gaussian, then Eq. (78) becomes zeros.

*i*.

*i*.

*d*. and the circular properties of

*W*(

*k*) and the fact that

*s*(

*n*) is deterministic, Eq. (77) becomes

## 16 Approximation of the detection probability

*Q*-function using a first-order Taylor series was proposed in [16] without justification. Here, we show by simulation the effectiveness of this approximation. The Taylor series of a function

*f*(

*t*) around

*t*

_{0}can be developed as follows:

where *f*
^{(n)}(*t*
_{0}) is the *nth* order derivative of *f*(*t*) at *t*
_{0}.

*g*

_{1}(

*γ*) and the second order,

*g*

_{2}(

*γ*), Taylor series approximations of

*g*(

*γ*) around

*γ*

_{0}can be found as follows:

*γ*

_{0}=

*λ*/

*b*as

*g*(

*γ*

_{0})=0, and then

*Q*(

*g*(

*γ*

_{0}))=0.5, which is the middle point of the

*Q*-function. Accordingly,

*g*

^{′}(

*γ*

_{0}) and

*g*

^{′′}(

*γ*

_{0}) can derived as follows:

*Q*(

*g*

_{1}(

*γ*)) and

*Q*(

*g*

_{2}(

*γ*)) under different conditions. Figure 14 a shows the variation of \(p_{d}^{p}\) and its approximations in terms of SNR for different

*p*

_{ fa }. The number of samples is fixed to 1500 and

*N*

_{ s }=4 sps, while Fig. 14 b shows under SNR of 10 dB and

*N*

_{ s }=4 sps, the variation of \(p_{d}^{p}\) and its approximations in terms of

*N*for different

*p*

_{ fa }. As shown, the analytic and the approximated curves are closed to each others under the various conditions. As expected,

*g*

_{2}(

*γ*) leads to a more robust approximation, since

*Q*(

*g*

_{2}(

*γ*)) is almost colinear with

*Q*(

*g*(

*γ*)). Even though,

*g*

_{1}(

*γ*) results are very closed to exact ones. As no important loss is obtained when

*g*

_{1}(

*γ*) is used, and since it is more simple to deal with the first-order Taylor series,

*g*

_{1}(

*γ*) will be considered to approximate the detection probability under Rayleigh fading channel.

## 17 The distribution of the self-normalized CPSD

*H*

_{0},

*η*

_{ y }(

*k*) can be written as follows:

*W*(

*u*) is Gaussian, \({\sum \nolimits }_{u=\nu }^{k}|W(u)|^{2}\) and \({\sum \nolimits }_{u=k+1}^{l}|W(u)|^{2}\) become

*χ*

^{2}distributed with 2(

*k*−

*ν*+1) and 2(

*l*−

*k*) degrees of freedom respectively [22]. Since

*W*(

*u*) are

*i*.

*i*.

*d*., then \({\sum \nolimits }_{u=\nu }^{k}|W(u)|^{2}\) and \({\sum \nolimits }_{u=k+1}^{l}|W(u)|^{2}\) become independent. Consequently,

*η*

_{ y }(

*k*) should follow a Beta distributed [21]:

*η*

_{ y }(

*k*) can be found as follows [21]:

## Declarations

### Authors’ contributions

All the authors have contributed to the analytic and numerical results, drafting of manuscript, and critical revision. All authors read and approved the final manuscript.

### Competing interests

The authors declare that they have no competing interests.

### Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

**Open Access** This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

## Authors’ Affiliations

## References

- J Mitola, Cognitive radio: Making software radios more personal. IEEE Pers. Commun.
**6**(4), 13–18 (1999).View ArticleGoogle Scholar - IF Akyildiz, BF Lo, R Balakrishnan, Cooperative spectrum sensing in cognitive radio networks: a survey. Phys. Commun.
**4**(1), 40–62 (2011).View ArticleGoogle Scholar - T Yucek, H Arslan, A survey of spectrum sensing algorithms for cognitive radio applications. IEEE Commun. Surv. Tutorials.
**11**(1), 116–130 (2009).View ArticleGoogle Scholar - A Nasser, A Mansour, KC Yao, H Charara, M Chaitou, in
*Efficient spectrum sensing approaches based on waveform detection*. Third International Conference on e-Technologies and Networks for Development (ICeND) (IEEEBeirut, 2014).View ArticleGoogle Scholar - R Tandra, A Sahai, SNR Walls for Signal Detection. IEEE J. Sel. Top. Sign. Process.
**2**(1), 4–17 (2008).View ArticleGoogle Scholar - A Nasser, A Mansour, KC Yao, H Charara, M Chaitou, in
*Spectrum sensing for full-duplex cognitive radio systems*. 11th International Conference on Cognitive Radio Oriented Wireless Networks (CROWNCOM) (SpringerGrenoble, 2016).View ArticleGoogle Scholar - DM Martinez, AG Andrade, Performance evaluation of Welch’s periodogram-based energy detection for spectrum sensing. IET Commun.
**7**(11), 1117–1125 (2013).View ArticleGoogle Scholar - F Digham, M-S Alouini, K Simon, On the energy detection of unknown signals over fading channels. IEEE Trans. Commun.
**55**(1), 21–24 (2007).View ArticleGoogle Scholar - I Sobron, P Diniz, W Martin, M Velez, Energy detection techniques for adaptive spectrum sensing. IEEE Trans. Commun.
**63**(3), 617–627 (2015).View ArticleGoogle Scholar - A Dandawate, G Giannakis, Statistical tests for presence of cyclostationarity. IEEE Trans. Signal Process.
**42:**, 2355–2369 (1994).View ArticleGoogle Scholar - M Derakhshani, T Le-Ngoc, M Nasiri-Kenari, Efficient cooperative cyclostationary spectrum sensing in cognitive radios at low SNR regimes. IEEE Trans. Wirel. Commun.
**10**(11), 3754–3764 (2011).View ArticleGoogle Scholar - Y Zhu, J Liu, Z Feng, P Zhang, Sensing performance of efficient cyclostationary detector with multiple antennas in multipath fading and lognormal shadowing environments. J. Commun. Netw.
**16**(2), 162–171 (2014).View ArticleGoogle Scholar - WM Jang, Blind cyclostationary spectrum sensing in cognitive radios. IEEE Commun. Lett.
**18**(3), 393–396 (2014).MathSciNetView ArticleGoogle Scholar - G Zhang, X Wang, Y-C Liang, J Liu, Fast and robust spectrum sensing via Kolmogorov-Smirnov test. IEEE Trans. Commun.
**58**(12), 3410–3416 (2010).View ArticleGoogle Scholar - D Teguig, V Le Nir, B Scheers, Spectrum sensing method based on the likelihood ratio goodness of fit test. Electron Lett.
**51**(3), 253–255 (2015).View ArticleGoogle Scholar - M Naraghi-Poor, T Ikuma, Autocorrelation-based spectrum sensing for cognitive radio. IEEE Trans. Veh. Technol.
**59**(2), 718–733 (2010).View ArticleGoogle Scholar - S Atapattu, C Tellambura, H Jiang, Energy detection for spectrum sensing in cognitive radio (Springer, 2014). ISBN: 9781493904938.Google Scholar
- WA Gardner, A Napolitano, L Paura, Cyclostationarity: half a century of research. Signal Process.
**59**(4), 639–697 (2006).View ArticleMATHGoogle Scholar - GB Giannakis, in The Statistical Signal Processing Section of Digital Signal Processing Handbook, ed. by VK Madisetti, D Williams. Cyclostationary signal analysis (CRC Press, 1999). ISBN: 9781420045635.Google Scholar
- C Iouna, A Mansour, A Quinquis, E Radoi, Digital signal processing using MATLAB (Wiley, 2008). ISBN: 9781848210110.Google Scholar
- M Barkat, Signal detection and estimation (Artech House, 2005). ISBN: 9780387941738.Google Scholar
- A Mansour, Probabilités et statistiques pour les ingénieurs: cours, exercices et programmation (Hermes Science, 2007). ISBN: 9782746219366.Google Scholar
- R Gallager, Stochastic processes: theory for applications (Cambridge University Press, 2013). ISBN: 9781107039759.Google Scholar
- M Abramowitz, IA Stegun, Handbook of mathematical functions with formulas, graphs, and mathematical tables (Dover Publications, 1972). ISBN: 9780486612720.Google Scholar
- Z Khalaf, A Nafkha, J Palicot,
*Blind spectrum detector for cognitive radio using compressed sensing*(IEEE GLOBECOM, Houston, 2011).View ArticleGoogle Scholar - P Urriza, E Rebeiz, D Cabric, Multiple antenna cyclostationary spectrum sensing based on the cyclic correlation significance test. IEEE J. Sel. Areas Commun.
**31:**, 2185–2195 (2013).View ArticleGoogle Scholar - A Nasser, A Mansour, KC Yao, H Abdallah, in
*Spectrum access and management for cognitive radio networks*, ed. by M Matin. Spectrum sensing for half and full-duplex cognitive radio (Springer, 2017). doi:10.1007/978-981-10-2254-8-2. - W Gardner, The spectral correlation theory of cyclostationary time-series. Signal Process.
**11:**, 13–36 (1986).View ArticleGoogle Scholar