Spectrum Sensing Theories and Methods

Spectrum sensing is a critical step in cognitive radio based DSM to learn the radio environment. Despite its long history, in the past decade, the study on spectrum sensing has attracted substantial interests from the wireless communications community. In this chapter, we ﬁrst provide the fundamental theories on spectrum sensing from the optimal likelihood ratio test perspective, then we review the classical methods including Bayesian method, robust hypothesis test, energy detection, matched ﬁltering detection, and cyclostationary detection. After that, we discuss the robustness of the classical methods and review techniques that can enhance the sensing reliability under hostile environment. These methods include eigenvalue based sensing method, covariance based detection method. Finally, we discuss the cooperative sensing that uses data fusion or decision fusion from multiple senors to enhance the sensing performance.


Introduction
As mentioned in Chap. 1, the basic idea of a cognitive radio is to support spectrum reuse or spectrum sharing, which allows the secondary networks/users to communicate over the spectrum allocated/licensed to the primary users (PUs) when they are not fully utilizing it. To do so, the secondary users (SUs) are required to frequently perform spectrum sensing, i.e., detecting the presence of the PUs. Whenever the PUs become active, the SUs have to detect the presence of them with a high probability, and vacate the channel or reduce transmit power within certain amount of time. For example, in the IEEE 802.22 standard [1][2][3], it is required for the SUs to detect the TV and wireless microphone signals and vacate the channel within two seconds once they become active. Furthermore, for TV signal detection, it is required to achieve 90% probability of detection and 10% probability of false alarm at signal-to-noise ratio (SNR) level as low as −20 dB [1].
Spectrum sensing has reborn as a very active research topic in the past decade despite its long history in signal detection field. Quite a few new sensing methods have been proposed which take into consideration practical requirements and constraints. In this chapter, we first provide the fundamental spectrum sensing theories from the optimal likelihood ratio test perspective, then review the classical methods including Bayesian method, robust hypothesis test, energy detection, matched filtering detection, and cyclostationary detection. After that, we discuss the robustness of the classical methods and review techniques that can enhance the sensing reliability under hostile environment, including eigenvalue based sensing method, and covariance based detection. Finally, we discuss the cooperative spectrum sensing techniques that uses data fusion or decision fusion to combine the sensing data from multiple senors.

System Model for Spectrum Sensing
We consider an SU spectrum sensor with M ≥ 1 antennas. A similar scenario is the multi-node cooperative sensing, if all M distributed nodes are able to send their observed signals to a central node. There are two hypotheses: H 0 , the PU is inactive; and H 1 , the PU is active. The received signal at antenna/node i, i = 1, . . . , M, is given by where η i (n) is the received noise plus possible interference. At hypothesis H 1 , s i (n) is the received primary signal at antenna/node i, which is the transmitted primary signal passing through the wireless channel to the sensing antenna/node. That is, s i (n) can be written as h i (l)s (n−l) (3.3) wheres(n) stands for the transmitted primary signal, h i (l) and q i denote the propagation channel coefficient and channel order from the PU to the ith antenna/node. For simplicity, it is assumed that the signal, noise, interference, and channel coefficients are all real numbers, though the theory and derivation can be directly extended to complex signals in most of the cases. The objective of spectrum sensing is to choose one of the two hypotheses, H 0 or H 1 , based on the received signal samples at the SU sensor. The probability of detection, P d , and probability of false alarm, P f a , are defined as follows: where P(·|·) defines the conditional probability. There are interesting physical meanings for the above two probabilities: P d defines how well the PU is protected when it is using the spectrum, while P f a determines the opportunity the SU misses out when the PU is not using the spectrum. In general, a sensing algorithm is said to be "optimal" if it achieves the lowest P f a for a given P d with a fixed number of samples, though there could be other criteria to evaluate the performance of a sensing algorithm.
In order to apply both space and time processing, we stack the signals from the M antennas/nodes and L time samples to yield the following M L × 1 vectors: . . . (3.10) Accurate knowledge on the noise power σ 2 η is the key for many detection methods. Unfortunately, in practice, the noise uncertainty always presents. Due to the noise uncertainty [4][5][6], the estimated (or assumed) noise power may be different from the real noise power. Let the estimated noise power beσ 2 η = ασ 2 η . It is assumed that α (in dB) is uniformly distributed in an interval [−B, B], where B is called the noise uncertainty factor [5]. In practice, the noise uncertainty factor of a receiving device is typically in the range from 1 to 2 dB, but the environment/interference noise uncertainty can be much higher [5].

Design Challenges for Spectrum Sensing
The design of spectrum sensing methods in CR faces a few specific challenges including, among others, the following.
1. Low sensing SNR: A cognitive radio may need to sense the primary signal at very low SNR condition. This is to overcome the hidden node problem, i.e., a SU sensor hears very weak signal from the primary transmitter but can strongly interfere the primary receiver if it transmits (here the primary receiver looks like a hidden node). To avoid such interference, one solution is to require the SU sensor to have the capability to sense the presence of the primary signal at very low SNR.
For example, in the 802.22 standard, the sensing sensitivity requirement is as low as −20 dB. 2. Channel uncertainty: In wireless communications, the propagation channel is usually unknown and time variant. Such unknown channel makes coherent detection methods unreliable in practice. 3. Non-synchronization: It is hard to synchronize the received signal with the primary signal in time and frequency domains. This will cause traditional methods like preamble/pilot based detections less effective. 4. Noise uncertainty: The noise level may vary with time and location, which yields the noise power uncertainty issue for detection [4][5][6][7]. This makes methods relying on accurate noise power unreliable. Furthermore, the noise may not be white, which will further affect the effectiveness of many methods with white noise assumption. 5. Interference: There could be interferences from intentional or unintentional transmitters. Thus, the detector needs to have the capability to suppress the interference while identifying the primary signals.
While there have been a lot of spectrum sensing methods in the literature [8][9][10][11][12][13][14][15], many of them are based on ideal assumptions, and cannot work well in a hostile radio environment. We need the spectrum sensing to be robust to the unknown and maybe time-varying channel, noise and interference.

Classical Detection Theories and Methods
In this section, we first provide the fundamental theories on spectrum sensing from the optimal likelihood ratio test perspective, then we review the classical methods including Bayesian method, robust hypothesis test, energy detection, matched filtering detection, and cyclostationary detection.

Neyman-Pearson Theorem
The Neyman-Pearson (NP) theorem [16][17][18] states that, for a given probability of false alarm, the test statistic that maximizes the probability of detection is the likelihood ratio test (LRT) defined as where p(·) denotes the probability density function (PDF), and x denotes the received signal vector that is the aggregation of x(n), n = 0, 1, . . . , N − 1. Such a likelihood ratio test decides H 1 when T L RT (x) exceeds a threshold γ , and H 0 otherwise.
The major difficulty in using the LRT is its requirement on the exact distributions given in (3.11). Obviously, the distribution of random vector x under H 1 is related to the source signal distribution, the wireless channels, and the noise distribution, while the distribution of x under H 0 is related to the noise distribution. In order to use the LRT, we need to obtain the knowledge of the channels as well as the signal and noise distributions, which is practically difficult to realize.
If we assume that the channels are flat-fading, and the received source signal sample s i (n)'s are independent over n, the PDFs in LRT are decoupled as If we further assume that noise and signal samples are both Gaussian distributed, i.e., η(n) ∼ N(0, σ 2 η I) and s(n) ∼ N(0, R s ), the LRT becomes the estimator-correlator (EC) [16] detector for which the test statistic is given by From (3.10), we see that R s (R s + 2σ 2 η I) −1 x(n) is actually the minimum-meansquared-error (MMSE) estimation of the source signal s(n). Thus, T EC (x) in (3.14) can be seen as the correlation of the observed signal x(n) with the MMSE estimation of s(n).
The EC detector needs to know the source signal covariance matrix R s and noise power σ 2 η . When the signal presence is unknown yet, it is unrealistic to have the knowledge on the source signal covariance matrix which is related to unknown channels.

Bayesian Method and the Generalized Likelihood Ratio Test
In practical scenarios, it is difficult to know the likelihood functions exactly. For instance, we may not know the noise power σ 2 η and/or source signal covariance R s . Hypothesis testing in the presence of uncertain parameters is known as "composite" hypothesis testing. In classic detection theory, there are two main approaches to tackle this problem: the Bayesian method and the generalized likelihood ratio test (GLRT). needed in the LRT through marginalization, i.e., where 0 represents all the unknowns when H 0 is true. Note that the integration operation in (3.15) should be replaced with a summation if the elements in 0 are drawn from a discrete sample space. Critically, we have to assign a prior distribution p( 0 |H 0 ) to the unknown parameters. In other words, we need to treat these unknowns as random variables, and use their known distributions to express our belief in their values. Similarly, p(x|H 1 ) can be defined. The main drawbacks of the Bayesian approach are listed as follows: 1. The marginalization operation in (3.15) is often not tractable except for very simple cases; 2. The choice of prior distributions affects the detection performance dramatically and thus it is not a trivial task to choose them.
To make the LRT applicable, we may estimate the unknown parameters first and then use the estimated parameters in the LRT. Known estimation techniques could be used for this purpose. However, there is one major difference from the conventional estimation problem where we know that signal is present, while in the case of spectrum sensing we are not sure whether there is source signal or not (the first priority here is the detection of signal presence). At different hypothesis, H 0 or H 1 , the unknown parameters are also different.
The GLRT is one efficient method [16,18] to resolve the above problem, which has been used in many applications, e.g., radar and sonar signal processing. For this method, the maximum likelihood estimation of the unknown parameters under H 0 and H 1 are first obtained asˆ where 0 and 1 are the set of unknown parameters under H 0 and H 1 , respectively. Then, the GLRT statistic is formed as Finally, the GLRT decides H 1 if T G L RT (x) > γ , where γ is a threshold, and H 0 otherwise. It is not guaranteed that the GLRT is optimal or closes to the optimum when the sample size goes to infinity. Since the unknown parameters in 0 and 1 are highly dependent on the noise and signal statistical models, the estimations of them could be vulnerable to the modeling errors. Under the assumption of Gaussian distributed source signals and noises, and flat-fading channels, some efficient spectrum sensing methods based on the GLRT can be found in [19][20][21].

Robust Hypothesis Testing
The searching for robust detection methods has been of great interest in the field of signal processing and many others. In this section, we start from a general paradigm that is called robust hypothesis testing, then we review a few methods that are robust to certain impairments. In Sects. 3.3-3.5, we will discuss a few new methods, including eigenvalue based detections, covariance based detections, and cooperative sensing.
A useful paradigm to design robust detectors is the maxmin approach, which maximizes the worst case detection performance. Among others, two techniques are very useful for robust spectrum sensing: the robust hypothesis testing [22,23] and the robust matched filtering [24,25]. In the following, we will give a brief overview on them.
Let the PDF of a received signal sample be f 1 at hypothesis H 1 and f 0 at hypothesis H 0 . If we know these two functions, the LRT-based detection described in Sect. 3.2.2 is optimal. However, in practice, due to the channel impairment, noise uncertainty, and interference, it is very hard to obtain these two functions exactly. One possible situation is when we only know that f 1 and f 0 belong to certain classes. One such class is called the -contamination class given by where f 0 j ( j = 0, 1) is the nominal PDF under hypothesis H j , j in [1, 0] is the maximum degree of contamination, and g j is an arbitrary density function. Assume that we only know f 0 j and j (an upper bound for contamination), j = 1, 2. The problem is then to design a detection scheme to minimize the worst-case probability of error (e.g., probability of false alarm plus probability of mis-detection), i.e., finding a detectorˆ such that = arg min max Hubber [22] proved that the optimal test statistic is a "censored" version of the LRT given byˆ where (3.20) and c 0 , c 1 are nonnegative numbers related to 0 , 1 , f 0 0 , and f 0 1 [22,26]. Note that if choosing c 0 = 0 and c 1 = +∞, the test is the conventional LRT with respect to nominal PDFs, f 0 0 and f 0 1 . One special case is the robust matched filtering. We turn the model (3.10) into a vector form as where s is the signal vector and η is the noise vector. Suppose that s is known. In general, a matched-filtering detection is T M F = g T x. Let the covariance matrix of the noise be R η = E(ηη T ). If R η = σ 2 η I, it is known that choosing g = s is optimal. In general, it is easy to verify that the optimal g to maximize the SNR is In practice, the signal vector s may not be known exactly. For example, s may be only known to be around s 0 with some errors modeled by where is an upper bound on the Euclidean-norm of the error. In this case, we are interested in finding a proper value for g such that the worst-case SNR is maximized, i.e.,ĝ = arg max g min s:||s−s 0 ||≤ SNR(s, g) (3.25) It was proved in [24,25] that the optimal solution for the above maxmin problem iŝ where δ is a nonnegative number such that δ 2 ||ĝ|| 2 = .
It is noted that there are also researches on the robust matched filtering detection when the signal has other types of uncertainty [26]. Moreover, if the noise has uncertainties, i.e., R η is not known exactly, or both noise and signal have uncertainties, the optimal robust matched-filtering detector was also found for some specific uncertainty models in [26].

Energy Detection
If we further assume that R s = σ 2 s I, the EC detection in (3.14) reduces to the wellknown energy detector (ED) [4,27,28] for which the test statistic is given as follows (by discarding irrelevant constant terms).
Note that for the multi-antenna/node case, T E D is actually the summation of energies from all antennas/nodes, which is a straightforward cooperative sensing scheme [29][30][31].
The test statistic is compared with a threshold to make to decision. Obviously the threshold should be related to the noise power. Hence energy detection needs a priori information of the noise variance (power). It has been shown that energy detection is very sensitive to the inaccurate estimation of the noise power. We will give detailed discussion on this later.
From the derivation above, we know that energy detection is the optimal detection if there is only one antenna, the signal and noise samples are independent and identically distributed (iid) Gaussian random variables, and the noise variance (power) is known. Even if the signal and noise do not have Gaussian distribution, in most cases, energy detection is still approximately optimal for uncorrelated signal and noise at low SNR [32]. In general, the ED is not optimal if signals or noise samples are correlated.
The energy detection can be used in different ways and sometimes combined with other techniques.
(1) We can filter the signal before the energy detection is implemented. Let f (l) (l = 0, 1, . . . , L) be a filter or the combining of a bank of filters. The received signal after filtering is The energy detection after the filtering is therefore For practical applications, we can choose a narrowband filter or a bank of narrowband filters if we want to detect the signals in specific frequency bands.
(2) Energy detection can also be done in frequency domain. Let S i (k) be the power spectrum density (PSD) of the received signal x i (n). There are different methods to estimate the PSD including periodogram, multitaper method (MTM) [33,34] and others. For the periodogram method, the received signal is divided into P non-overlapped blocks: Note that DFT can be computed by the fast Fourier transform (FFT). The PSD is estimated as The test statistic of the frequency domain energy detection is: Again the test statistic is compared with a threshold to make a decision and the threshold should be related to the noise power. Among all the spectral estimation methods, the MTM is proved to achieve the performance close to the maximum likelihood PSD estimator [33,34]. Thus it can be used to make a more accurate estimation of the PSD for spectrum sensing [35]. However, the computational complexity is also increased.
(3) The frequency domain energy detection can also be done in a more flexible way. Let ψ be a subset of set {0, 1, . . . , N f − 1}. We can select the signal frequency within the bin ψ for detection and may also give different weights to different antennas and frequencies [36]. The test statistic is therefore where g i,k is the weight for antenna i and frequency index k. This can have a better performance if we know that the interested signal power has peaks or is concentrated in the frequency bin ψ. For example, for ATSC signal detection, we know that the signal has a strong peak at the pilot. So we can choose the set ψ to be the frequency index around the pilot location. A special case is to choose just one frequency index nearest to the pilot location. In some OFDM based standards, the pilot subcarriers have higher power than other subcarriers. We can put more weights to the pilot subcarriers.
Another variation of the method is to change the averaging of the signal PSD to maximizing [37]. The test statistic becomes The energy detection can also be done in other transform domains other than the Fourier transform domain. In general, let X i,T (k) (k = 0, 1, . . . , K − 1) be the transformed signal of the original received signal x i (n). The transform domain energy detection is For example, the wavelet can be chosen as the transform, which turns to the wavelet multi-resolution detection [38]. In general, the transform should be chosen based on the signal and noise property or/and purpose of detection.

Sequential Energy Detection
In the discussions above, we assume that the sensing time (number of signal samples N ) is a predefined fixed number. The detector is designed to have the optimal performance with the given sample size. In some applications, the sensing time may not be predefined. Our purpose is to design a detector that has the least average sensing time. A popular approach for this is the sequential detection [39][40][41].
In general, a sequential detector makes a decision whenever a new signal sample is available. For simplicity, here we consider single detector case. Let ) T be signal samples currently available at time k. The sequential detector calculates a test statistic T (x k ). It then makes a decision using two thresholds: where γ 1 > γ 0 are some predefined thresholds. If the test statistic is between γ 1 and γ 0 , that is, γ 0 < T (x k ) < γ 1 , the detector does not make a decision on H 1 or H 0 yet: more samples are required. The detector will continue this process when new signal samples are available till a decision on H 1 or H 0 is reached. Thus we do not know when the detection will finished to achieve the target sensing performance. The sensing time is a random number. It is proved that the average sensing time is shorter than the conventional methods (the Wald-Wolfowitz theorem [40]). However, the worst case sensing time could be much longer.
Using the energy detection for sequential detection is discussed in [40]. Some extensions and refinements can be found in [40].

Matched Filtering
If we assume that noise is Gaussian distributed and source signal s(n) is deterministic and known to the receiver, it is easy to show that the LRT in this case becomes the matched filtering based detector [16][17][18], for which the test statistic is The test statistic is compared with a threshold to make a decision. Obviously the threshold should be related to the noise power. Unlike energy detection, matched filtering (MF) is more robust to the inaccurate noise power estimation [6,7]. MF is also widely used in other fields like radar signal processing. Hence, theoretically matched filtering is optimal if the signal is deterministic and known at the receiver. The major difficulties in MF are the time delay, frequency offset and time dispersive channel.
For simplicity, we consider single antenna case here. In general, for a deterministic transmitted signal s(n), the received signal x(n) can be written as where τ is the timing error, is the normalized frequency offset and h(l) is the channel.
At ideal case of = 0, τ = 0, L = 0 and h(0) > 0, In this case, MF is optimal. In practical wireless communication applications, the CFO and timing error may not be zero, also the channel is most likely frequency selective: L > 0. So in general, the test statistic of MF should be expressed as The CFO , timing error and frequency selective are three major obstacles for the MF. Anyone of them could reduce the performance of MF dramatically.
To deal with the timing error, a commonly used solution is to averaging or taking the maximum of the test statistic at different time delays of the received signal. Let be the test statistic of the signal with time delay −υ. Obviously the best value is υ = τ . If we do not know the value of τ , we can average on different υ or take the maximum, that is, To tack the problem of CFO, we can modify the test of MF using the absolute value This test is not affected by the carrier frequency offset.
Similarly we can also average or take the maximum of the absolute value test statistics to deal with the timing error problem.
Like the energy detection, the MF can also be implemented in frequency domain or transformed domain. Using the MF for ATSC signal detection is discussed in [42].

Cyclostationary Detection
Practical communication signals may have special statistical features. For example, digitally modulated signals have non-random components such as double sideness due to sine wave carrier and keying rate due to symbol period. Such signals have a special statistical feature called cyclostationarity, i.e., their statistical parameters vary periodically in time. This cyclostationarity can be extracted by the cyclic autocorrelation (CAC) or the spectral-correlation density (SCD) [43][44][45].
For simplicity, in this section we consider single antenna case, that is, M = 1. For notation simplicity, we omit the subscript for antenna. For a given α and time lag τ , the CAC of a signal x(t) is defined as where α is called a cyclic frequency. If there exists at least one non-zero α such that max τ |R α x (τ )| > 0, we say that x(t) exhibits cyclostationarity. The value of such α depends on the type of modulation, symbol duration, etc. For example, for a digitally modulated signal with symbol duration T b , cyclostationary features exist at where f c is the carrier frequency, and k is an integer. Equivalently, we can define the SCD, the Fourier transform of the CAC, as follows: In binary spectrum sensing or signal detection, there are two hypotheses: H 0 , signal absent; and H 1 , signal present. The received signal can be written as where x(t) denotes the transmitted signal from the primary user, h(t) is the channel response, and η(t) is the additive noise. When source signal x(t) passes through a wireless channel h(t), the received signal is impaired by the unknown propagation channel. It can be shown that the SCD function of y(t) is where * denotes the conjugate, α denotes the cyclic frequency for Thus, the unknown channel could have major impacts on the strength of SCD at certain cyclic frequencies.
Cyclostationary detection (CSD) is well studied when Nyquist rate signal samples are available. The rationale behind the CSD is that the signal x(t) has cyclostationarity, that is, there exists at least one non-zero cyclic frequency α such that R α x (τ ) = 0 for some τ , while the noise η(t) is a pure stationary process, that is, for any non-zero In the following, we list the cyclic frequencies for some signals with cyclostationarity in practical applications [44,45].
1. Analog TV signal: It has cyclic frequencies at multiples of the TV-signal horizontal line-scan rate (15.75 KHz in USA, 15.625 KHz in Europe). 2. AM signal: x(t) = a(t) cos(2π f c t + φ 0 ). It has cyclic frequencies at ±2 f c . 3. PM and FM signal: . It usually has cyclic frequencies at ±2 f c . The characteristics of the SCD function at cyclic frequency ±2 f c depend on φ(t). 4. Digital modulated signals: For BPSK, it has cyclic frequencies at k/ s , k = 0, and ±2 f c + k/ s , k = 0, ±1, ±2, . . .. For QPSK, it has cycle frequencies at k/ s , k = 0.

OFDM modulated signal: It has cyclic features at cyclic frequency k/(N t T b ),
where k is an integer number, N t is the length of an OFDM block (FFT size plus CP size), and T b is the symbol duration.
Let α 0 be a non-zero cyclic frequency such that R α 0 x (τ ) = 0 for some τ . Assume that the signal and noise are mutually independent. Then we have In the frequency domain, this turns to Therefore, H 0 and H 1 can be distinguished by generating a test statistic from the CAC/SCD of the received signal at cyclic frequency α 0 and comparing the test statistic with a threshold. A typical test statistic is In practice, the received signal is sampled and only limited number of samples are available. Let T s be the sampling period and N be the number of samples. The discrete version of the CAC is where the lag k = 0, 1, . . . , M − 1 with M << N . Accordingly the discrete version of the test statistic is In CSD, the test statistic is compared with a threshold to make a decision. Intuitively the threshold should be related to noise power. Due to the difficulty in acquiring the accurate noise power in practice [7,46,47], we can use the maximum likelihood estimation of the noise power. The maximum likelihood estimation of the noise power isσ The threshold is thus chosen as βσ 4 η , where β is a scalar to meet the pre-defined probability of false alarm.
There are other different test statistics and decision rules (thresholds) for the CSD. Especially, if the signal has cyclostationarity at multiple cyclic frequencies, how to use them to form a single test statistic is an interesting problem. In [48,49], a general structure based on the GLRT principle is proposed to use the multiple cyclic frequencies. However, the method needs very high complexity and also some priori information on the channel. Some simplified approaches have also been studied [50]. The use of the CSD for ATSC signal is proposed [51]. There are also researches on OFDM signal detections using the CSD [50,[52][53][54].
When interference exists, the CSD may still work well as long as the interference does not have the same cyclostationary feature as the primary signal. In general, the chance that the primary signal and the interference have the same cyclostationary feature is slim. That means CSD is robust to interference and noise uncertainty. Furthermore, it is possible to distinguish the signal type because different signal may have different non-zero cyclic frequencies.
Although cyclostationary detection has certain advantages, it also has some disadvantages: 1. The method needs a very high sampling rate; 2. The computation of SCD function requires large number of samples and thus high computational complexity; 3. The strength of SCD could be affected by the unknown channel [46]; 4. The sampling time error and frequency offset could affect the cyclic frequencies [55,56], which will be discussed further in the next section.

Detection Threshold and Test Statistic Distribution
To make a decision on whether signal is present, we need to set a threshold γ for each proposed test statistic, such that certain P d and/or P f a can be achieved. For a fixed sample size N , we cannot set the threshold to meet the targets for arbitrarily high P d and low P f a at the same time, as they are conflicting to each other. Since we have little or no prior information on the signal (actually we even do not know whether there is a signal or not), it is difficult to set the threshold based on P d . Hence, a common practice is to choose the threshold based on P f a under hypothesis H 0 . Without loss of generality, the test threshold can be decomposed into the following form: γ = γ 1 T 0 (x), where γ 1 is related to the sample size N and the target P f a , and T 0 (x) is a statistic related to the noise distribution under H 0 . For example, for the energy detection with known noise power, we have For the matched-filtering detection with known noise power, we have In practice, the parameter γ 1 can be set either empirically based on the observations over a period of time when the signal is known to be absent, or analytically based on the distribution of the test statistic under H 0 . In general, such distributions are difficult to find, while some known results are given as follows.
For energy detection defined in (3.27), it can be shown that for a sufficiently large values of N , its test statistic can be well approximated by the Gaussian distribution [14,28], i.e., Accordingly, for given P f a and N , the corresponding γ 1 can be found as where For the matched-filtering detection defined in (3.37), for a sufficiently large N , we have 1 Thereby, for given P f a and N , it can be shown that For the GLRT-based detection, it can be shown that the asymptotic (as N → ∞) log-likelihood ratio is central chi-square distributed [16]. More precisely, where r is the number of independent scalar unknowns under H 0 and H 1 . For instance, if σ 2 η is known while R s is not, r will be equal to the number of independent real-valued scalar variables in R s . However, there is no explicit expression for γ 1 in this case.

Eigenvalue Based Detections
Eigenvalue based detections (EBD) was first proposed in [47,[57][58][59][60]. The method was later studied and refined in [19,[61][62][63][64]. EBD can be derived from different approaches such as the GLRT principle or information theory. Some examples on the derivations can be found in [19,20,64]. The threshold setting of the EBD needs random matrix theory [47,[57][58][59][60]. The EDB methods solve the noise uncertainty problem by using statistical covariance matrix to estimate the noise power. The method can detect signal without knowing explicit information of the signal. The method was also adopted by IEEE802.22 standard as a solution to detect TV and wireless microphone signals.

The Methods
We consider the same model as defined at the beginning of this chapter. Let N j We have [47] x(n) = Hs(n) + η(n) (3.66) where Note that the dimension of H j is M L × (N j + L). Define the statistical covariance matrices of the signals and noise as We can verify that where σ 2 η is the variance of the noise, and I M L is the identity matrix of order M L.
Let the eigenvalues of R x and HR s H † be λ 1 ≥ λ 2 ≥ · · · ≥ λ M L and ρ 1 ≥ ρ 2 ≥ · · · ≥ ρ M L , respectively. Obviously, λ n = ρ n + σ 2 η . When there is no signal, that is, s(n) = 0 (then R s = 0), we have λ 1 = λ 2 = · · · = λ M L = σ 2 η . Hence, λ 1 /λ M L = 1. When there is a signal, if ρ 1 > ρ M L , we have λ 1 /λ M L > 1. Hence, we can detect if signal exists by checking the ratio λ 1 /λ M L . Obviously, ρ 1 = ρ M L if and only if HR s H † = λI M L , where λ is a positive number. From the definition of the matrix H and R s , it is highly probable that HR s H † = λI M L . In fact, the worst case is R s = σ 2 s I, that is, the source signal samples are iid. At this case, HR s H † = σ 2 s HH † . Obviously, σ 2 s HH † = λI M L if and only if all the rows of H have the same power and they are co-orthogonal. This is only possible when N j = 0, j = 1, . . . , P and M = 1, that is, the source signal samples are iid, all the channels are flat-fading and there is only one receiver.
Thus, if M > 1 (multiple antennas) or the channel has multiple paths or the source signal itself is correlated, the eigenvalues of the R x are not identical, while at pure noise case, the R x should have identical eigenvalues. Hence, we can check the eigenvalues of R x to see if signal presents.
In practice, we only have finite number of samples. Hence, we can only obtain the sample covariance matrix other than the statistic covariance matrix. The sample covariance matrix is defined as where N is the number of collected samples. Based on the sample covariance matrix and its eigenvalues, a few methods have been proposed based on different prospectives [19,47,[57][58][59][60][61][62][63][64]. Such methods are called eigenvalue based detections (EBD).
Here we summarize the methods as follows.

Algorithm Eigenvalue based detections
Step 1. Compute the sample covariance matrix as defined in (3.73).
Step 2. Calculate the eigenvalues of the sample covariance matrix.
Step 3. Compute a test statistic from the eigenvalues. There are different approaches to construct the test statistic. A few simple but effective method are as follows:

Maximum eigenvalue to trace detection (MET). The test statistic is
where t r (·) is the trace of a matrix, t r (R x (N )) = M L i=1 λ i . This method is also called blindly combined energy detection (BCED) in [60]. 2. Maximum to minimum eigenvalue detection (MME) [47]. The test statistic is 3. Arithmetic to geometric mean (AGM) [19]. The test statistic is Step 4. Compare the test statistic with a threshold to make a decision.
All these methods do not use the information of the signal, channel and noise power as well. The methods are robust to synchronization error, channel impairment, and noise uncertainty.

Threshold Setting
To find a formula for the threshold is mathematically involved. In general we need to find the theoretical distribution of some combination of the eigenvalues of a random matrix. There have been some exciting works on this by using the random matrix theory [47,[61][62][63][65][66][67][68]. For simplicity, in the following, we provide an example for the maximum eigenvalue detection (MED) with known noise power [59]. At this case, we actually compare the ratio of the maximum eigenvalue of the sample covariance matrix R x (N ) to the noise power σ 2 η with a threshold γ 1 . To set the value for γ 1 , we need to know the distribution of λ 1 (N )/σ 2 η for any finite N . Fortunately, the random matrix theory has laid the foundation to derive the distributions.
When there is no signal, R x (N ) reduces to R η (N ), which is the sample covariance matrix of the noise only. It is known that R η (N ) is a Wishart random matrix [69]. The study of the eigenvalue distributions for random matrices is a very hot research topic over recent years in mathematics, communications engineering, and physics [69][70][71][72]. The joint PDF of the ordered eigenvalues of a Wishart random matrix has been known for many years [69]. However, since the expression of the joint PDF is very complicated, no simple closed-form expressions have been found for the marginal PDFs of the ordered eigenvalues, although some computable expressions have been found in [73]. Recently, I. M. Johnstone and K. Johansson have found the distribution of the largest eigenvalue [70,71] of a Wishart random matrix as described in the following theorem.
converges (with probability one) to the Tracy-Widom distribution of order 1 [74,75]. The Tracy-Widom distribution provides the limiting law for the largest eigenvalue of certain random matrices [74,75]. Let F 1 be the cumulative distribution function (CDF) of the Tracy-Widom distribution of order 1. We have where q(u) is the solution of the nonlinear Painlevé II differential equation given by Accordingly, numerical solutions can be found for function F 1 (t) at different values of t. Also, there have been tables for values of F 1 (t) [70] as shown in Table 3.1.
Using the above results, we can derive the probability of false alarm as Thus we have (3.80) or equivalently, From the definitions of μ and ν in Theorem 3.1, we finally obtain the value for γ 1 as Note that γ 1 depends only on N and P f a . A similar approach like the above can be used for the case of MME detection, as shown in [47,68].

Performances of the Methods
To show the performance and the robustness of the methods, here we give some simulation results for the EBDs. Comparison with the energy detection (ED) is also included. We consider two cases here: the signal is time uncorrelated and the signal is time correlated. The Receiver Operating Characteristics (ROC) curves (P d versus P f a ) at SNR = −15 dB, N = 5000, and M = 4 are plotted at the two cases. The performance at first case in shown in Fig. 3.2 with L = 1 and that at the second case is shown in Fig. 3.3 with L = 6, where "ED-udB" means energy detection with u dB noise uncertainty. In Fig. 3.3, the source signal is the wireless microphone signal [76] and a multipath fading channel (with eight independent taps of equal power) is assumed. For both cases, MET, MME and AGM perform better than ED. MET, MME and AGM are totally immune to noise uncertainty. However, the ED is very vulnerable to noise power uncertainty [4][5][6].
Obviously the eigenvalue based detections do not use the information of the signal, channel and noise power as well. The methods are robust to synchronization error, channel impairment, and noise uncertainty. However, like other blind detections, the methods are vulnerable to unknown narrowband interferences.

Covariance Based Detections
Covariance based detections (CBD) was first proposed in [65,77]. The method solved the noise uncertainty problem by using the online estimated noise power. The method can detect signal without knowing explicit information of the signal. The method was also adopted by IEEE802.22 standard for detecting TV signal and as the first choice for sensing the wireless microphone signals.

The Methods
As shown in the last section, the covariance matrix of the received signal can be written as If the signal s(n) is not present, R s = 0. Hence the off-diagonal elements of R x are all zeros. If there is signal and the signal samples are correlated, R s is not a diagonal matrix. Hence, some of the off-diagonal elements of R x should be non-zeros. In practice, the statistical covariance matrix can only be calculated using a limited number of signal samples. For notation simplicity, here we consider the case of single antenna/sensor M = 1, and drop the indices for antenna/sensor. Define the sample auto-correlations of the received signal as where x(m) is the received signal samples, and N s is the number of available samples. The statistical covariance matrix R x can be approximated by the sample covariance matrix R x (N s ) as defined in the last section. At M = 1, R x (N s ) can be formed by the auto-correlations r (l). Note that the sample covariance matrix is symmetric and Toeplitz. Based on the generalized likelihood ratio test (GLRT) or information/signal processing theory, there have been a few methods proposed based on the sample covariance matrix. One class of such methods is called covariance based detections (CBD) [1,65,76,77]. Some methods that directly use the auto-correlations of the signal can also be included in this class [78]. The covariance based detections directly use the elements of the covariance matrix to construct detection methods, which can reduce computational complexity. The methods are summarized in the following.
Let the entries of the matrix R x (N s ) be c mn (m, n = 1, 2, . . . , M L).

Algorithm Covariance based detections
Step 1. Compute the sample covariance matrix R x (N s ) as defined in (3.73).
Step 2. Construct a test statistic directly from the entries of the sample covariance matrix. In general, the test statistic of the CBD is where F 1 and F 2 are two functions. At single antenna/sensor case, it can be written equivalently as r (0), . . . , r (L − 1))/F 2 (r (0), . . . , r (L − 1)) (3.86) There are many ways to choose the two functions. Some special cases are shown in the following.

Fixed auto-correlation detection (FACD): The test statistic is
where m 0 and n 0 are fixed numbers between 1 and M L. At single antenna case, the detection can be written equivalently as This detection is especially useful when we have some prior information on the source signal correlation and knows the lag that produces the maximum autocorrelation. For example, it can be used for detect the OFDM signal by using the CP or pilot property [52].
Step 3. Compare the test statistic with a threshold to make a decision.
All these methods do not use the information of the signal, channel and noise power as well. The methods are robust to synchronization error, channel impairment, and noise uncertainty.
The test statistic is compared with a threshold γ to make a decision. The threshold γ is determined based on the given P f a . To find a formula for the thresholds is mathematically involved [65,77]. We will show an example for M = 1 in the following subsection.
The computational complexity of the algorithm is as follows (for M = 1). Computing the auto-correlations of the received signal requires about L N s multiplications and additions. Computing T 1 (N s ) and T 2 (N s ) requires about L 2 additions. Therefore, the total number of multiplications and additions is about L N s + L 2 .

Detection Probability and Threshold Determination
It is generally difficult to find closed-form detection probabilities. For this purpose, we need to find the distribution of test statistics. In [65,76,77], approximations for the distribution of the test statistics has been found by using central limit theorem for M = 1. Furthermore, the theoretical estimations for the two probabilities, P d , P f a , as well as the threshold associated with these probabilities, were also discussed. Here we summarize the results as follows.
In the following, we consider the case of M = 1. Denote c nm as the element of sample covariance matrix R x (N s ) at the nth row and mth column, and let The test statistic of the CAVD is then It is shown in [65,76,77] that which is the overall correlation strength among the consecutive L samples. When there is no signal, we have (3.96) Note that this ratio approaches to 1 as N s approaches to infinite. Also note that the ratio is not related to the noise power (variance). On the other hand, when there is signal (signal plus noise case), we have Here the ratio approaches to a number larger than 1 as N s approaches to infinite. The number is determined by the correlation strength among the signal samples and the SNR. Hence, for any fixed SNR, if there are sufficiently large number of samples, we can always differentiate if there is signal or not based on the ratio. However, in practice we have only limited number of samples. So, we need to evaluate the performance at fixed N s .
First we analyze the P f a at hypothesis H 0 . For given threshold γ 1 , the probability of false alarm for the CAVD algorithm is For a given P f a , the associated threshold should be chosen such that That is, Note that here the threshold is not related to noise power and SNR. After the threshold is set, we now calculate the probability of detection at various SNR. For the given threshold γ 1 , when signal presents, For very large N s and low SNR, we have and Hence, we have a further approximation Obviously, the P d increases with the number of samples, N s , the SNR and the correlation strength among the signal samples. Note that γ 1 is also related to N s as shown above, and lim N s →∞ γ 1 = 1. Hence, for fixed SNR, P d approaches to 1 when N s approaches to infinite.

Performance Analysis and Comparison
To compare the performances of any methods, first we need a criterion. By properly choosing the thresholds, many methods can achieve any given P d and P f a > 0 if sufficiently large number of samples are available. The key point is how many samples are needed to achieve the given P d and P f a > 0. Hence, we choose this as the criterion to compare the two algorithms. For a target pair of P d and P f a , based on (3.105) and (3.101), we can find the required number of samples for the CAVD as For fixed P d and P f a , N c is only related to the smoothing factor L and the overall correlation strength ϒ L . Hence, the best smoothing factor is which is related to the correlation strength among the signal samples.
Here we give a comparison of the CBD with the energy detection. Energy detection simply compares the average power of the received signal with the noise power to make a decision. To guarantee a reliable detection, the threshold must be set according to the noise power and the number of samples [4][5][6]. On the other hand, the proposed methods do not rely on the noise power to set the threshold (see Eq. (3.101)), while keeping other advantages of the energy detection. Simulations have shown that the proposed method is much better than the energy detection when noise uncertainty is present [65,76,77]. Hence, here we only compare the proposed method with the ideal energy detection (assume that noise power is known exactly).
For energy detection, the required number of samples is approximately [5] Comparing (3.106) and (3.108), if we want N c < N e , we need For example, if P d = 0.9 and P f a = 0.1, we need ϒ L > 1 + L−1 4.54 . In conclusion, if the signal samples are highly correlated such that (3.109) holds, the CAVD is better than the ideal energy detection; otherwise, the ideal energy detection is better.
In terms of the computational complexity, the energy detection needs about N s multiplications and additions. Hence, the computational complexity of the proposed methods is about L times that of the energy detection.

Cooperative Spectrum Sensing
When there are multiple secondary users/receivers distributed at different locations, it is possible for them to cooperate to achieve higher sensing reliability. There are various sensing cooperation schemes in the current literature [28,29,41,[79][80][81][82][83][84][85][86][87][88][89][90][91][92]. In general, these schemes can be classified into two categories: (A) Data fusion: each user sends its raw data or processed data to a specific user, which processes the data collected and then makes the final decision; and (B) Decision fusion: multiple users process their data independently and send their decisions to a specific user, which then makes the final decision.

Data Fusion
Theoretically, the LRT based on the multiple sensors is the best. However, there are two major difficulties in using the optimal LRT based method: (1) it needs the exact distribution of x, which is related to the source signal distribution, the wireless channels, and the noise distribution; (2) it may needs the raw data from all sensors, which is very expensive for practical applications.
In some situations, the signal samples are independent in time, that is, E(s i (n) s i (m)) = 0, for n = m. If we further assume that the noise and signal samples have Gaussian distribution, i.e., η(n) ∼ N(0, R η ) and s(n) ∼ N(0, R s ), where R s = E(s(n)s T (n)), R η = E(η(n)η T (n)) (3.110) the LRT can be obtained explicitly as [89] log Note that in general the cross-correlations among the signals from different sensors are used in the detection here. It means that the fusion center needs the raw data from all sensors, if the signals from different sensors are correlated in space. The reporting of the raw data is very expensive for practical applications. If the sensors are distributed at different locations and far apart, the primary signal will very likely arrive at different sensors at different times. That is, in (3.3) τ ik may be different for different i. For example, assuming that we are sensing a channel with 6 MHz bandwidth with sampling rate 6 MHz, delay of one data sample approximately equals to 50 m distance. In a large size network like a 802.22 cell (typically with radius 30 km), the distance differences of different sensors to the primary user could be as large as several kilo-meters. Therefore, the relative time delays τ ik can be as large as 20 samples or more. If the delays are different, the signals at the sensors will be independent in space.
For distributed sensors, their noises are independent in space. If we aim for sensing at very low SNR, the received signal at a sensor will be dominated by noise. Hence even if the primary signals at different sensors may be weakly correlated, the whole signals (primary signals plus noises) can be treated approximately as independent in space at low SNR. So, in the following, we further assume that E(s i (n)s j (n)) = 0, for i = j.
Under the assumptions we have . Under the assumptions, we can express the LRT equivalently as (3.115) and γ i = σ 2 s,i /σ 2 η,i . Note that T E D,i is the normalized energy at sensor i. The LRT is simply a linearly combined (LC) cooperative sensing. This method is also called cooperative energy detection (CED), which combines the energy from different sensors to make a decision. Thus there are three assertions for cooperative sensing by distributed sensors with time independent signals: 1. the optimal cooperative sensing is the linearly combined energy detection; 2. the combining coefficient is a simple function of the SNR at the sensor; 3. a sensor only needs to report its normalized energy and SNR to the fusion center, and no raw data transmission is necessary.
If the signals are time dependent, the derivation of the LRT becomes much more difficult. Furthermore, the information of correlation among the signal samples is required. There have been methods to exploit the time and space correlations of the signals in a multi-antenna system [14]. If the raw data from all sensors are sent to the fusion center, the sensor network may be treated as a single multi-antenna system (virtual multi-antenna system). If the fusion center does not have the raw data, how to fully use the time and space correlations is still an open question, though there have been some sub-optimal methods. For example, a fusion scheme based on the CAVD is given in [87], which has the capability to mitigate interference and noise uncertainty.
A major difficulty in implementing the method is that the fusion center needs to know the SNR at each user. Also the decision and threshold are related to the SNR's, which means that the detection process changes dynamically with the signal strength and noise power.
If P = 1, the propagation channels are flat-fading (q ik = 0, ∀i, k), and τ ik = 0, ∀i, k, the signal at different antennas can be coherently combined first and then the energy detection is used [28,31,93]. The method is called maximum ratio combined (MRC) cooperative energy detection.
It is optimal if the noise powers at different sensors are equal. Note that the MRC needs the raw data from all sensors and also the channel information.
We have proved that the LRT is actually a LC scheme. It is natural to also consider other LC schemes. In general, a LC scheme simply sums the weighted energy values to obtain the following test statistic where g i is the combining coefficient with g i ≥ 0. If we allow the combining coefficients to depend on the SNRs of sensors, we know that the optimal sensing should choose g i = γ i /(1 + γ i ). So the problem is how we design a LC scheme that does not need the SNR information or only uses partially available SNR information, while its performance does not degrade much. One such scheme is the equal gain combine (EGC) [14,28,83,84,93,94], i.e., g i = 1/M for all i: EGC totally ignores the differences of sensors. If the normalized signal energies at different sensors have large differences, a natural way is to choose the largest normalized energy for detection. We call this maximum normalized energy (MNE) cooperative sensing. The test statistic is Note that this is different from the method that uses the known sensor with the largest normalized signal energies. The largest normalized energy may not always be at the same sensor due to the dynamic changes of wireless channels. The method is equivalent to the "OR decision rule" [79,86].

Decision Fusion
In decision fusion, each sensor sends its one-bit (hard decision) or multiple-bit decision (soft-decision) to a central processor that deploys a fusion rule to make the final decision.
Let us consider the case of hard decision: sensor i sends its decision bit u i ("1" for signal present and "0" for signal absent) to the fusion center. Let u be the vector formed from u i . The test statistic of the optimal fusion rule is thus the LRT [79]: Assuming that the sensors are independent, we have Let A 1 be the set of i such that u i = 1 and A 0 be the set of i such that u i = 0. The above expression can be rewritten as where P d,i and P f a,i are the probability of detection and probability of false alarm for user i, respectively. Taking logarithm, we obtain By ignoring some constants not related to u i , the expression can be rewritten as The test statistic is a weighted linear combination of the decisions from all sensors. The weight for a particular sensor reflects its reliability, which is related to the status of the sensor (for example, signal strength, noise power, channel response, and threshold). If all sensors have the same status and choose the same threshold, the weights are equal and therefore the LRT is equivalent to the popular "K out of M" rule: if and only if K decisions or more are "1"s, the final decision is "1". This includes "Logical-OR (LO)" (K = 1), "Logical-AND (LA)" (K = M) and "Majority" (K = M 2 ) as special cases [79]. Let the probability of detection and probability of false alarm of the method are respectively and While the Neyman-Pearson Theorem tells us that "K out of M" rule is optimal (for equal sensors case), it does not stipulate how to choose the threshold t h and K . In general, to get the best threshold t h and K we need to solve some optimization problems for different purpose.
If each user can send multiple-bit decision to the fusion center, a more reliable decision can be made. A fusion scheme based on multiple-bit decisions is shown in [29]. In general, there is a tradeoff between the number of decision bits and the fusion reliability. There are also other fusion rules that may require additional information [79,99].

Robustness of Cooperative Sensing
Let the noise uncertainty factor of sensor i be α i . Assume that all sensors have the same noise uncertainty bound. For the linear combination, the expectation of noise power in T LC is therefore Hence, the noise uncertainty factor for LC fusion is α LC = 1/ M i=1 (g i /α i ). Note that α i and 1/α i are limited in [10 −B/10 , 10 B/10 ] and have the same distribution. Hence α LC is also limited in [10 −B/10 , 10 B/10 ]. EGC is a special case of LC. Based on the well-known central limit theorem (CLT), it is easy to verify the following theorem for EGC [56]. It means that, as M approaches to infinite, there is no noise uncertainty for EGC fusion rule. We can prove similar result for some other data fusion rules. Hence, data fusion does reduce the noise uncertainty impact. For example, at N = 5000 and SNR μ = −15 dB, the ROC curve for 20 sensors is shown in Fig. 3.4.
Although cooperative sensing can achieve better robustness and performance, there are some issues associated with it. First, additional bandwidth is required to exchange information among the cooperating users. In an ad-hoc network, this is by no means a simple task. Second, the information exchange may induce errors, which may have a major impact on fusion performance.

Cooperative CBD and EBD
As shown in the last sections, CBD and EBD are robust sensing methods that are immune to noise uncertainty. Thus it is interesting to use it for cooperative sensing as well. In [87], methods were proposed to use the CBD and EBD for cooperative sensing. Here we give a brief review of the methods.
It is assumed that there are M ≥ 1 sensors/receivers in a network. The sensors are distributed in different locations so that their local environments are different and independent. Each sensor has only one antenna. Other than the previous model, here we consider that the received signal may be contaminated by interference. There are two hypothesizes: H 0 and H 1 , which corresponds to signal absent or present, respectively. The received signal at sensor/receiver i and time n is given as Here ρ i (n) is the interference (like spurious signals) to sensor i, which may be emitted from other electronic devices due to non-linear Analog-to-Digital Converters (ADC) or from other intentional/un-intentional transmitters. Note that interferences to different sensors could be different due to their location differences. η i (n) is the Gaussian white noise to receiver i. s(n) is the primary user's signal and h i is the propagation channel from the primary to receiver i. τ i is the relative time delay of the primary signal reaching sensor i. Note that primary signal may reach different sensors at different times due to their location differences. In the following we consider baseband processing and assume that the signal, noise and channel coefficients are complex numbers.

The Methods
Let the auto-correlation of the signal bê Based on the analysis above, at hypothesis H 0 , R x is approximately an diagonal matrix, while at hypothesis H 1 , R x is far from diagonal if the primary signal samples are time correlated. Based on the sample covariance matrix, the eigenvalue based detections (EBD) discussed in the last sections can also be used here. We summarize the cooperative eigenvalue based detection (CEBD) as follows.

Algorithm Cooperative Eigenvalue Based Detection
Step 1-Step 3. Same as Algorithm CCBD.
Step 4. Form the sample covariance matrix and compute the maximum eigenvalue ζ max , and trace of the matrix R x , denoted as T r .
Step 5. Determine the presence of the signal based on ζ max and T r and a threshold γ . That is, if ζ max /T r > γ , signal exists; otherwise, signal does not exist.

Comparisons with Other Methods
There have been extensive studies on cooperative sensing. Some of the methods have been discussed in Sect. 3.5.1. Among them, the cooperative energy detection (CED) is the most popular method. Here we choose the CED for comparison.
In general, ED needs to know the noise power. A wrong estimation of noise power will greatly degrade its performance [7,47]. CED improves somewhat but still vulnerable to the noise power uncertainty as shown above. Furthermore, when unexpected interference presents, CED will treat it as signal and hence gives high probability of false alarm.
Compared with CED, advantages of CCBD/CEBD are: (1) as an inherent property of covariance and eigenvalue based detection [47,65], CCBD/CEBD is robust to noise uncertainty; (2) due to the cancellation of auto-correlations at non-zeros lags, CCBD/CEBD is not sensitive to interferences; (3) it is naturally immune to wideband interference, since such interferences have very weak time correlations; (4) there is no need for noise power estimation at all which reduces implementation complexity.
Compared to single sensor covariance and eigenvalue based detections [47,65], which may be affected by correlated interferences, CCBD/CEBD overcomes this drawback by cancelation of the adversary impact in the data fusion.

Summary
In this chapter, spectrum sensing techniques, including classical and newly-developed robust methods, have been reviewed in a systematic way. We start with the fundamental sensing theories from the optimal likelihood ratio test perspective, then review the classical methods including Bayesian method, robust hypothesis test, energy detection, matched filtering detection, and cyclostationary detection. After that, robust sensing methods, including eigenvalue based sensing method, and covariance based detection, are discussed in detail, which enhance the sensing reliability under hostile environment, Finally, cooperative spectrum sensing techniques are reviewed which improve the sensing performance through combining the test statistics or decision data from multiple senors. It is pointed out that this chapter only covers the basics of spectrum sensing, but there are many topics are not covered here, such as wideband spectrum sensing [100][101][102][103] and compressive sensing [104][105][106][107], interested readers are encouraged to refer to the relevant literatures.
Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as 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.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.