Open Access

Elaborate analysis and design of filter-bank-based sensing for wideband cognitive radios

  • Konstantinos Maliatsos1Email author,
  • Athanasios Adamis1 and
  • Athanasios G Kanatas1
EURASIP Journal on Advances in Signal Processing20142014:82

Received: 12 December 2013

Accepted: 1 May 2014

Published: 3 June 2014


The successful operation of a cognitive radio system strongly depends on its ability to sense the radio environment. With the use of spectrum sensing algorithms, the cognitive radio is required to detect co-existing licensed primary transmissions and to protect them from interference. This paper focuses on filter-bank-based sensing and provides a solid theoretical background for the design of these detectors. Optimum detectors based on the Neyman-Pearson theorem are developed for uniform discrete Fourier transform (DFT) and modified DFT filter banks with root-Nyquist filters. The proposed sensing framework does not require frequency alignment between the filter bank of the sensor and the primary signal. Each wideband primary channel is spanned and monitored by several sensor subchannels that analyse it in narrowband signals. Filter-bank-based sensing is proved to be robust and efficient under coloured noise. Moreover, the performance of the weighted energy detector as a sensing technique is evaluated. Finally, based on the Locally Most Powerful and the Generalized Likelihood Ratio test, real-world sensing algorithms that do not require a priori knowledge are proposed and tested.


Filter bankSpectrum sensingCognitive radioOptimum detectorsGLRTLMP

1 Introduction

Spectrum sensing has been brought into the center of research activities due to its application in the context of cognitive radio (CR) [1]. Cognitive radio and dynamic spectrum access have been identified as the means to maximize spectrum exploitation and efficiency. The cognitive radios share the available spectrum with a licensed primary system (PS) and have the responsibility not to adversely affect the PS user operation by causing interference. Spectrum sensing is used to identify and consequently avoid co-existing primary signals. Several spectrum sensing techniques have been derived and studied [2, 3]. These algorithms present pros and cons concerning the need for a priori knowledge of PS signals features, the computational complexity, the robustness in channel variations and coloured noise etc.

In [4], the introduction of filter-bank-based sensing was made and further analysis was provided in [5]. The main advantage of this technique lies in the fact that since the CR networks will use multicarrier modulations for transmission, the analysis filters that are intended for receiver operation, e.g. in OFDM-OQAM [6, 7], in discrete wavelet multiTone [8] and in filtered multiTone [9], could also be used for sensing without extra computational workload. In [10], filter-bank-based physical layer design for CR systems was introduced, where simultaneous spectrum sensing and transmission may be possible using the filter bank. In [4] and [5], Fahrang-Boroujeny examined the filter bank operation as an estimator of the power Spectral density (PSD) incorporating a spectrum analyser in the receiver structure. A comparison in the performance of the estimation with the non-parametric multitaper method [11] was also made. It was confirmed that the use of a filter bank can similarly achieve remarkable spectral analysis with the use of a larger set of samples but much less computational complexity.

However, in [4, 5], no detectors were presented that could be practically used to identify primary emissions in a given band of interest. Since then, several studies were made regarding filter-bank-based sensing. Most studies consider simplified models for the operation of the filter bank and do not attain optimality [12, 13]. In [14], filter bank sensing is performed using data-aided feature detection achieving results in extremely low signal-to-noise ratio (SNR); however, the algorithm required knowledge for specific features of the PS signal. Some studies focus on the reduction of the computational workload [1517], while others propose new filters suitable for sensing [18, 19]. In addition, special issues have been addressed that concern the application of filter banks in spectrum sensing [20, 21]. Moreover, in [22, 23], efficient implementations of filter bank sensors are presented.

This study is motivated by the absence of strong theoretical description for filter-bank-based sensors. A variety of detectors are presented for uniform and modified discrete Fourier transform (uniform DFT-MDFT) filter banks and especially root-Nyquist filters. As in [14], filter banks are implemented using the polyphase structure in order to perform simultaneous parallel sensing on all subchannels; however, the proposed algorithms are not based on specific signal feature extraction. Optimality based on the Neyman-Pearson theorem [24] is achieved. Moreover, the designed sensors are based on the approach that there is no ‘1-1’ matching of the receiver filters and the PS signal bandwidth. This is a common flaw among the majority of filter-bank-based sensing studies. Primary signals are in their vast majority wideband, while the CR filter bank has the objective to divide the monitored spectrum into narrowband channels. Therefore, in a common configuration, a primary channel is spanned and analysed by a number of CR filters. The use of multiple CR filters on a single PS transmission also eliminates the need for frequency alignment between the primary signal and the CR detector. An additional advantage is that the filter bank can partially exploit the radio channel frequency selectivity without the need for complicated equalization procedures on the primary signal. In [25] and [26], multiple CR subchannels are also used to span the primary signal. In the first study, a technique for SNR estimation of the PS signal is proposed using simple approximations, while in [26] the authors introduce a weighted energy detector scheme that is able to efficiently scan Bluetooth channels.

In Section 2, the used system model is presented. In Section 3, the Neyman-Pearson optimal detectors for uniform DFT banks are extracted, while in Section 4, the optimal detectors in the output of an OFDM-OQAM receiver (using an MDFT bank) are studied. In Section 5, the weighted energy detector for uniform DFT banks is analysed, and in Section 6, the extension of the filter bank sensing application in coloured noise is presented. It is noted that coloured noise has been identified [5] as a significant challenge for spectrum sensing applications. Finally in Section 7, practical implementations of the detectors - the Locally Most Powerful (LMP) test and the Generalized Likelihood Ratio Test (GLRT) - are proposed. Simulation results are presented in Section 8.

2 System model

A CR system is assumed that digitizes a large portion of spectrum containing K channels of the PS. The wideband received signal is analysed by a bank of M>K filters that span the whole digitized bandwidth. Consequently, each PS channel is analysed by L=M / K filters. A graphical representation of a 32-channel filter bank that spans the bandwidth that contains four PS channels is presented in Figure 1. In the specific example, the output from eight subchannels can be used to extract the decision on whether a PS channel is occupied or not.
Figure 1

Filter bank configuration example for M = 32 in a bandwidth containing four PS channels.

Given the fact that the wideband CR receiver should optimize the use of the limited computational resources, the analysis focuses on uniform DFT [27] filter banks with downsampling at the Nyquist rate. The well-known computationally efficient polyphase structure can be assumed. The type-1 polyphase representation of an finite impulse response (FIR) filter is the following [28]:
h i 1 n = h Mn + i , H z = i = 0 M - 1 z - i H i 1 z M
where the subscript indicates the i th polyphase filter path, while the superscript defines the type of polyphase representation. Analysis is also expanded in filter banks used by OFDM-OQAM systems. The specific filters present similarities with the cosine-modulated filter banks and their digitally equivalent representation is the MDFT [29] filter banks [29]. Ideally, a digital implementation of an OFDM-OQAM system will use MDFT filter banks with perfect reconstruction (PR) properties. In many cases, the PR property is sacrificed for better time-frequency localization; however, these filters can also be expressed with the MDFT structure and it is highly desired to approximate the behaviour of MDFT-PR. Two equivalent structures of an OFDM-OQAM receiver are presented in Figure 2 (where normalization and phase correction coefficients are arbitrarily set since they do not affect the results of the specific study). The two filter structures are equivalent for D filter coefficients where α = D - 1 M / 2 = 2 α , i.e., α is even. Nevertheless, the selection of odd α does not affect the MDFT-filter bank-based spectrum sensing results.
Figure 2

Two OFDM-OQAM receiver filter structures. (a) Conventional implementation and (b) parallel uniform DFT bank implementation.

Moreover, the assumed prototype filter is real and symmetric ensuring linear phase response. Deeper analysis is performed for filter banks using a root-Nyquist prototype filter [30]. The root-Nyquist filters are typically used for pulse shaping in radio communication systems due to the InterSymbol Interference (ISI)-free transmission properties. It is noted that the necessary and sufficient condition for MDFT-PR filters suitable for OFDM-OQAM also leads to root-Nyquist filters [29].

The n th time sample of the received signal from the output of the A/D converter is represented by r n , while y n i represents the output of the i th filter. It is assumed that the filter impulse response is normalized so that the mean input and output signal powers remain constant, if the incoming signal is contained in the specific filter passband. Thus, h u = p u u = - p u 2 , where p u is the FIR filter prototype. Using a non-casual filter representation, the Nyquist ISI-free condition is expressed by
g n = u = - h u h n - u = 1 , n = 0 0 , n = lM , l 0
The presented theoretical analysis assumes that the transmitted PS signal s n is circular white Gaussian random variable with mean power at the receiver (over a flat channel) σ s 2 . This assumption is accurate for orthogonal frequency division multiplexing (OFDM) signals, but it is questionable for single carrier signals. However, since the signal passes through a cascade of filters and transceiver impairments, each signal sample is the result of linear combinations and shifts that includes a large number of random variables. Thus, a generalized version of the Central Limit Theorem can be invoked to justify the Gaussian assumption for the PS signal. The incoming signal at the CR receiver for given PS transmissions under frequency selective channels is provided by
r n = k = 0 K - 1 ζ k u = 0 c u ( k ) s n - u ( k ) + w n
where the superscripts indicate the transmitted signal at the k th primary channel, and the ζ k coefficient is equal to 0 if the k th channel is free, or 1 if the k th channel is occupied. Filter c u ( k ) represents the radio channel impulse response for the k th PS channel. The formulated detection problem concerns the use of the available information from multiple filter bank outputs in the decision of whether a primary channel is occupied or not. Therefore, the binary decision problem for the k th primary channel is expressed as
0 : ζ k = 0 r n ( k ) = w n 1 : ζ k = 1 r n ( k ) = u = 0 c u ( k ) s n - u ( k ) + w n
The observation vector that contains the information used for the decision is a set of N samples (depending on the sensing duration) for each of the L filters that span the primary channel under investigation. The following vectors are defined:
y l = y n ( l ) y n - 1 ( l ) y n - N + 1 ( l ) T
y n ( l ) = u = - h u ( l ) r Mn - u

where h u ( l ) is the impulse response for the l th subchannel of the filter bank. In (6), it is assumed that the signal is maximally decimated at the output. Without loss of generality, L is assumed even for presentation purposes. No additional information on primary signal features and specifications is assumed. The next step is the definition of the detectors.

3 Neyman-Pearson optimal detectors for maximally decimated signals

The energy detector is the simplest and most common spectrum sensing technique with low complexity and minimum knowledge regarding the primary system. The energy detector can be seen as a special case of filter-bank-based sensing with M=1 and K=1. It is proved that for zero-mean white Gaussian input, the energy detector is optimal according to the Neyman-Pearson theorem [24] for known PS signal power σ s 2 and additive white Gaussian noise (AWGN) with σ w 2 .
T = n = 0 N - 1 y n 2 0 1 γ
The metric T follows a scaled χ2 distribution as the sum of squares of white Gaussian zero-mean random variables [31] with 2N degrees of freedom. It is proved that T follows the distributions below:
T = σ w 2 2 χ 2 N 2 If 0 , σ w 2 + σ s 2 2 χ 2 N 2 If 1

In this paper, the energy detector is used as a reference for the evaluation of the extracted algorithms.

When referring to maximally decimated signals, it is considered that the rate of the signals at the filter output is reduced to the minimum as it is defined by the Nyquist sampling theorem. This means that the specific detector operates at the output of a uniform DFT filter bank (or the output of one of the parallel banks in an OFDM-OQAM system before the real-imaginary separation - Figure 2b). The sensing mechanism can be considered as a vector detection problem with vector observations from L different sensors. Assuming that the k0th primary channel is observed, the output from the filter paths with indexes k0L+l, l=0,…,L-1 is collected.

The first step is to define a single observation vector with the use of a reordering technique for the selected vectors. For reasons that will be cleared out at the next steps, the following reordering is selected:

  • The observation vectors are divided in two groups:
    • Group 0 contains the even subchannels.

    • Group 1 contains the odd subchannels.

  • Spatial reordering (or row rollout [24]) is performed (choosing first the group 0 vector). Therefore,
    y = y ( 0 ) H | y ( 1 ) H H = y 0 H y 2 H y L - 2 H | y 1 H y 3 H y L - 1 H H

    where y l is given in (5). For simplicity reasons, the common term k0L of the vector subscripts was omitted. Subvectors y i represent the observation vector per filter path, i.e. per subchannel.

The signal PSD under 1 after filtering and before decimation is given by
S y i y i f = S rr f H f - f i 2 = k = 0 K - 1 C ( k ) f 2 S ss ( k ) f + S ww f H f - f i 2
where C(k)(f) is the radio channel transfer function for the PS signal that occupies the k th subchannel and S ss ( k ) f , S rr f the respective PSDs for s n and r n respectively. As in [4], it is considered that the receiver filters are adequately narrowband. This assumption is valid for OFDM-OQAM systems since by design the filters should divide the whole bandwidth in subchannels where the radio channel frequency response can be considered approximately flat (since otherwise computationally cumbersome equalization methods would be required). Therefore, the following approximation can be considered:
S y i y i f C f i 2 S ss f + S ww f H f - f i 2 = c i 2 σ s 2 + σ w 2 H f - f i 2
where the PSDs for the white Gaussian signal and noise were used. The c i coefficient is a measure of the radio channel effect for the specific subchannel obtained by the radio channel Fourier transform. Although this study assumes flat radio channel per filter subchannel, this requirement is not very strict. During simulation and detector evaluation, the radio channel models did not provide strictly flat radio channels per filter. Nevertheless, under realistic channel conditions, no significant fluctuations from the assumed optimum performance under the flat channel assumption was observed. Moreover, a better approximation of the c i coefficients can be made with the use of a mean value of the frequency selective channel transfer function for each subchannel filter. More specifically,
c i 2 = 1 BW - C f H f - f i 2 df
where BW is the total bandwidth. From (11), it is concluded that with the use of the narrowband filter, the input signal for each subchannel can be considered an AWGN random variable with r i N 0 , c i 2 σ s 2 + σ w 2 I N , despite the radio channel effects. Under 0 , the input signal is also AWGN with r i N 0 , σ w 2 I N . In Figure 3, two examples of Rayleigh channels with exponential power delay profiles (PDP) are presented. The first example (maximum delay spread 12 samples and exponent λ=1) presents a quite accurate flat narrowband channel approximation. In the second case (maximum delay spread 24 samples with exponent 0.5), frequency selectivity is apparent in the passband. However, the flat approximation is used in both cases with higher expected deviation from the ideal for the second example.
Figure 3

Examples of radio channel transfer functions per subchannel for M = 32 and Rayleigh channels with exponential power delay profiles.

Generally, for large M and adequately small number of filter coefficients, the filter transition bandwidth is not quite sharp. However, it can be assumed that the subchannels of the filter bank provide sufficient attenuation at the passband so that the following approximation stands:
H f - f i H f + f i + l 0 , i = 0 , , M - 1 i + l = 0 , , M - 1 l - 1 , 0 , 1
In (13) it is claimed that the outputs from two filter paths that are not directly adjacent are uncorrelated and under the Gaussian assumption independent. According to the Neyman-Pearson theorem, the detector that optimizes the probability of detection PD for given probability of false alarm PFA is provided by the likelihood ratio:
f y / 1 f y / 0 0 1 θ

where f is the probability density function (PDF) for the random variable (operand ‘ /’ indicates a conditional probability). Threshold θ is selected in order to achieve the desired PFA. In order to define the threshold, the distributions of the vector random variables, as well as the distributions of the final detection metric must be defined. Based on the initial assumptions, y is a multidimensional Gaussian variable. The first task is to determine its covariance matrix. Similarly to the energy detector, the SNR, or equivalently the signal and noise powers, should be known. More specifically, the investigated detector should be aware of the SNR per subchannel that is given by γ i = c i 2 σ s 2 σ w 2 . Initially, this information is assumed known. In a real-world design of the detector, an estimation procedure is performed before or during the detection (Section 7).

3.1 Distribution under 0

The determination of the covariance matrix for the specified block vector with spatial reordering is made using the following relationship:
E y y H = E 00 | E 01 - - - | - - - E 10 | E 11
E ij = E y i y j H E y i y j + 2 H E y i y j + L - 2 H E y i + 2 y j H E y i + 2 y j + 2 H E y i + 2 y j + L - 2 H E y i + L - 2 y j H E y i + L - 2 y j + 2 H E y i + L - 2 y j + L - 2 H
Initially, in order to quantify the effect of the filter bank on the variables, the input signal variance for all subchannels is assumed to be σ2=1. The covariance of the maximally decimated signal for each subchannel separately is given by [4]
ρ y i y i n = u = - h u e 2 πj ui M h Mn + u e - 2 πj ui + Mni M = u = - h u h Mn + u = g Mn
For a root-Nyquist filter and according to (2), the result is equal to unity for n=0 and zero otherwise. Therefore, the output samples of each subchannel are uncorrelated despite the filter bank.
E y i y i H = ρ y i y i 0 ρ y i y i N - 1 ρ y i y i - N + 1 ρ y i y i 0 = I N
Based on the aforementioned assumption (13), the output vectors from not direct-adjacent filter paths are uncorrelated and therefore,
E y i y i + l H = 0 N , l - 1 , 0 , 1

It remains to calculate the cross-correlation R m , n = ρ y i y i + l m - n ( m , n = 1 N ) between the output samples of adjacent filters (l=-1,1).

The elements of R are calculated with the following formula:
R k , m = E y n ( i ) y n + m - k ( i + l ) = E y n ( i ) y n + ε ( i + l ) = u = - p = - h u h p e 2 πj iu M e - 2 πj ( i + l ) p M E r Mn - u r Mn - p +
where m-k=ε. For zero-mean white Gaussian input with σ2=1, the following result is extracted:
R k , m = δ p + - u u = - p = - h u h p e 2 πj iu M e - 2 πj ( i + l ) p M = u = - h u h u - e 2 πj iu M e - 2 πj ( i + l ) u - M = u = - h u e - 2 πj lu M h u -
which can be proved to be equal to the following:
R k , m = g M m - k cos u = - h u cos 2 πu M h u + M k - m R = g 0 cos g M cos g M N - 1 cos g - M cos g 0 cos g - M N - 1 cos g 0 cos
The matrix R is real. It is noted that filters are expressed with a non-casual representation in order to exploit symmetries in a simple way. As a next step, the following LN 2 × LN 2 low triangular block matrix is defined:
P R 0 0 R R 0 0 R R 0 0 0 R R L / 2 N × N matrices
Based on the definition of (23) and using (18), (19) and (22), the produced result is given by
E y y H / r N 0 , 1 Δ= C = I LN / 2 | P - - - P T | I LN / 2
The definition of the L N×L N matrix leads directly to the extraction of the covariance matrix for variable y given that the primary channel is free ( 0 ) . It is straightforward to claim that
0 : C y = C w = σ w 2 C y / 0 N 0 , σ w 2 C
The fact that C is expressed as a 2×2 block matrix with identity matrices in the block diagonal justifies the selection of the specific reordering since the computations are now quite simplified. More specifically, the inverse of C is given by ([32])
C - 1 = I LN / 2 - P P T - 1 | - P I LN / 2 - P T P - 1 - - - - P T I LN / 2 - P P T - 1 | I LN / 2 - P T P - 1
An important feature is that the determinant of C can be easily calculated using C = I LN / 2 - P P T [33], since the matrix is real and symmetric. In addition, the conditional probabilities between groups 0 (even filter paths) and 1 (odd filter paths) are extracted:
y N 0 , C w y ( 0 ) / y ( 1 ) N P y ( 1 ) , σ w 2 I - P P T y ( 1 ) / y ( 0 ) N P T y ( 0 ) , σ w 2 I - P T P

3.2 Distribution under 1

According to the initial assumptions, the primary signal s n follows the normal distribution with mean power σ s 2 . Initially, a noiseless channel is assumed. Due to the radio channel and based on the approximation in (11), the input signal power per subchannel is given by the multiplication of the mean signal power with a radio channel coefficient, i.e. the assumed input per subchannel is given by r n ( i ) = c i s n and the mean input signal power per subchannel is E r n ( i ) 2 = E c i s n 2 = c i 2 σ s 2 . The calculation of the covariance matrix of the observation vector is made using the procedure of the previous paragraph with the introduction of the radio channel coefficient effects. Since the result presented in (18) has been computed for standard zero-mean Gaussian input (σ2=1), the autocovariance matrix for the output of the i th filter path, when the input is given by r n ( i ) = c i s n , is provided by
E y i y i H = c i 2 σ s 2 I N
The cross-covariance submatrix between filter outputs of non-directly adjacent paths is once again zero. For directly adjacent filter paths, computation is performed as in (20) with the inclusion of the channel coefficients.
R k , m = E y n ( i ) y n + m - k ( i + l ) = E y n ( i ) y n + ε ( i + l ) = u = - p = - h u h p e 2 πj iu M e - 2 πj ( i + l ) p M E c i s Mn - u c i + l s Mn - p +
In order to avoid complex coefficients, since there is no simple method to estimate their phase, the following rationale is considered: A complex zero-mean Gaussian variable can also be seen as a pair of two random variables: (a) the Rayleigh amplitude s n Rayleigh σ s 2 and (b) the uniform in [0,2π) phase φ s n U 0 , 2 π . After the application of the channel coefficient on the signal, the considered input of the i th filter is given by
r n ( i ) = c i s n e j φ s n = c i s n e j φ s n + φ c i
However, the radio-channel-induced phase shifts due to the uniform phase distribution and periodicity will not cause any variation in the signal phase distribution and therefore:
φ s n + φ c i U 0 , 2 π s n = s n e j ( φ s n + φ c i ) N 0 , σ s 2
From (31) and (30) it is extracted that
r n ( i ) N 0 , c i 2 σ s 2
Using (32) and (29) similarly to (21), it is concluded that
E y i y i + l H = σ s 2 c i c i + l R
The diagonal matrix Σ is defined:
Σ = c 0 I N 0 0 0 0 c 2 I N 0 0 0 0 c L - 2 I N 0 0 0 0 c 1 I N 0 0 0 c 3 I N 0 0 0 0 0 0 c L - 1 I N
where the diagonal elements contain the channel coefficients according to the adopted reordering. Based on the definition of Σ, it is concluded that under 1 with no noise, the received signal covariance matrix is given by
C s = σ s 2 Σ C Σ
Let us now assume that AWGN with mean power σ w 2 is also present during reception. In this case, the input for the i th subchannel assuming that the primary signal s n follows the zero-mean Gaussian distribution with mean power σ s 2 is given by
r n ( i ) = c i s n + w n
where w n is the noise component with w n N 0 , σ w 2 . It was proved for a noiseless signal in (32) that c i s n N 0 , c i 2 σ s 2 . The input signal for the i th subchannel r n ( i ) is given by the sum of two zero-mean Gaussian variables with variances c i 2 σ s 2 and σ w 2 . Based on the properties of the Gaussian distribution [24] and given that signal and noise are independent and uncorrelated random variables, r n ( i ) will also follow the zero-mean Gaussian distribution and its variance will be provided by the sum of the variances of the two random variables (signal and noise). Therefore,
r n ( i ) N 0 , c i 2 σ s 2 + σ w 2
If z n is a zero-mean Gaussian variable with σ2=1, then the variable c i 2 σ s 2 + σ w 2 z n follows the same distribution with r n ( i ) and it can be used for the calculation of the autocovariance and cross-covariance matrices. Similarly to (28) and (29), it is proved that
E y i y i H = c i 2 σ s 2 + σ w 2 I N
and for l=±1,
E y n ( i ) y n + m - k ( i + l ) = u = - p = - h u h p e 2 πj iu M e - 2 πj ( i + l ) p M × E r Mn - u r Mn - p + = u = - p = - h u h p e 2 πj iu M e - 2 πj ( i + l ) p M × × E c i 2 σ s 2 + σ w 2 z Mn - u × c i + l 2 σ s 2 + σ w 2 z Mn - p + = c i 2 σ s 2 + σ w 2 c i + l 2 σ s 2 + σ w 2 R k , m
which concludes that E y i y i + l H = c i 2 σ s 2 + σ w 2 c i + l 2 σ s 2 + σ w 2 R . The combination of the results from (38) and (39) are now used to extract the correlation matrix for vector y defined in (9). It is proved that
C y = Σ y C Σ y , C y - 1 = Σ y - 1 C - 1 Σ y - 1
where Σ y is the diagonal matrix containing the factors c i 2 σ s 2 + σ w 2 .
Σ y = σ s 2 Σ 2 + σ w 2 I LN 1 / 2
Thus, based on the Gaussian distribution properties, since the observation vector under 1 is a linear transformation of the zero-mean Gaussian input and its covariance matrix is given by (40), it follows the distribution of (42):
y / 1 N 0 , σ s 2 Σ 2 + σ w 2 I LN 1 / 2 C σ s 2 Σ 2 + σ w 2 I LN 1 / 2

If the known (or estimated) quantity is the SNR γ i , the channel coefficients can be calculated from c i 2 = γ i σ w 2 / σ s 2 .

3.3 The detector metric

In order to define the detector, starting from (14), the log-likelihood relationship is formed:
ln C w - ln C y + y H C w - 1 y - y H C y - 1 y 0 1 ln θ y H C w - 1 - C y - 1 y 0 1 θ = ln θ + ln C y - ln C w
Therefore, the metric that will be used for the decision is provided by
T y = y H C w - 1 - C y - 1 y

3.4 Metric distribution under 0

Initially, the eigenvalue decomposition of matrix C=U Λ UH is performed and since C is hermitian U UH=UHU=I. With the use of the eigenvalues and eigenvectors, an interim variable can be defined:
z = 1 σ w Λ - 1 / 2 U H y
It is simple to prove that this variable decorrelates the samples of vector y and that z N 0 , I LN . Thus, the metric can be written as
y H C w - 1 - C y - 1 y z H σ w Λ 1 / 2 U H 1 / σ w 2 C - 1 - Σ y - 1 C - 1 Σ y - 1 × U Λ 1 / 2 σ w z = z H I - σ w 2 Λ 1 / 2 U H Σ y - 1 C - 1 Σ y - 1 U Λ 1 / 2 z
In order to calculate the eigenvalues of the matrix that appears at the quadratic form of the metric, the definition of the characteristic polynomial is used:
det I - σ w 2 Λ 1 / 2 U H Σ y - 1 C - 1 Σ y - 1 U Λ 1 / 2 - χ I = det σ w 2 Λ 1 / 2 U H Σ y - 1 C - 1 Σ y - 1 U Λ 1 / 2 + χ - 1 I = det Λ det σ w 2 Σ y - 1 C - 1 Σ y - 1 + χ - 1 C - 1 = 0

The determinant of Λ can be omitted. In order to move forward, the approach described below is followed:

  • The inverse of C-1 is also an hermitian matrix.

  • Thus, the matrix V = σ w 2 Σ y - 1 C - 1 Σ y - 1 + χ - 1 C - 1 can be seen as the sum of two covariance matrices of multidimensional Gaussian variables. It is known from probability theory [34] that if two random variables are independent, the covariance matrix of their sum is equal to the sum of the covariance matrices. Let us assume a random variable that follows the distribution N ( 0 , σ w 2 Σ y - 2 ) and a second random variable that follows the distribution N ( 0 , ( χ - 1 ) I ) . In addition, the two variables are considered independent. It is assumed that the variables are added and applied to the selected filter bank. Then, the covariance matrix of their sum at the output of the bank will be provided by matrix V.

  • However, for independent Gaussian variables a different approach can be used that produces equivalent results. The sum of two independent zero-mean Gaussian random variables is also a zero-mean Gaussian random variable. The variance of the sum is equal with the sum of variances [34]. Therefore, instead of considering the sum of two independent random variables applied to the filter bank, it is equivalent to assume a single random variable that follows the distribution N ( 0 , σ w 2 Σ y - 2 + ( χ - 1 ) I ) .

  • Based on the second approach, the covariance matrix at the output of the filter will be given by
    W = σ w 2 Σ y - 2 + χ - 1 I 1 2 C - 1 σ w 2 Σ y - 2 + χ - 1 I 1 2
  • The extraction of the covariance matrix in this case is performed using the same procedure that was followed in (39), (40) and (41).

  • Since the two procedures are equivalent for Gaussian random variables, it is expected that the equivalence will also stand between the covariance matrices V and W and therefore they can be used interchangeably. The followed approach is valid, since the eigenvalues extracted by V are applied on the Gaussian random variable z N 0 , I LN . In addition, the validity of the procedure was verified with extended tests.

  • Thus, instead of calculating the determinant of V, we proceed using matrix W. From (48) and given the fact that the determinant of C is non-zero (since C is invertible), it is extracted that
    det σ w 2 Σ y - 2 + χ - 1 I = 0 χ i = 1 - σ w 2 σ s 2 c i 2 + σ w 2
  • With the use of V- W equivalence, the metric matrix is considered to have L discrete eigenvalues with N degrees of multiplicity each. The eigenvector matrix does not play any role in the procedure and it does not need to be calculated. Since U is unitary, the random variable z ~ = U H z will follow the same distribution as z. Therefore, the metric under 0 is given by
    T y / 0 = l = 0 L - 1 n = 0 N - 1 σ s 2 c l 2 σ s 2 c l 2 + σ w 2 z ~ n + lN 2
  • In order to verify the validity of the predescribed equivalence, extended tests were performed for various filters and radio channels. The eigenvalues of matrix V were numerically extracted and used directly for metric calculation. It was observed that in all cases, the eigenvalues of V and W were very similar. However, the most important observation was that they produced, as expected, identical distributions when applied to z for metric calculation. Therefore, the equivalence was also verified via simulations.

In (50), each z ~ i element follows the standard complex Gaussian distribution (unit variance). Consequently,
2 z ~ n + lN 2 χ 2 2
The chi-square distribution can be considered a special case of Gamma distribution. In fact, if a random variable ω follows the χ 2 2 distribution, for a positive constant β, the variable β ω follows the gamma distribution with parameters (1,2β) [35]. Therefore,
σ s 2 c l 2 σ s 2 c l 2 + σ w 2 z ~ n + lN 2 G 1 , σ s 2 c l 2 σ s 2 c l 2 + σ w 2
where denotes the gamma distribution. In order to calculate the metric distribution, the characteristic function for is used. Moreover, since the addends in (50) are independent, the characteristic function of the total metric will be given by the product of the functions of the individual variables. Thus,
φ T ( y / 0 ) τ = n = 0 L - 1 1 1 - j σ s 2 c l 2 σ s 2 c l 2 + σ w 2 τ N
The PDF is given by the inverse Fourier of the characteristic function at point -t.
f T y / 0 t = F - t - 1 n = 0 L - 1 1 1 - j σ s 2 c l 2 σ s 2 c l 2 + σ w 2 τ N
The calculation of the analytical solution is not a straightforward task because of the fact that each eigenvalue is repeated N times. An analytical solution can be achieved using the distribution provided in [36] where the positive definite matrix of [36] is the identity matrix. The metric distribution is given by
f T y t > 0 / 0 = i = 1 L - 1 λ min udft / 0 λ l udft / 0 N × k = 0 d k t LN + k - 1 e - t λ min udft / 0 λ min udft / 0 LN + k Γ LN + k
where coefficients d k are calculated iteratively using
d 0 = 1 , d k + 1 = N k + 1 i = 1 k + 1 l = 1 L - 1 1 - λ min udft / H 0 λ l udft / H 0 i d k + 1 - i , k = 0 , 1 , 2
and the λ i s are the L discrete eigenvalues, thus,
λ i udft / 0 = σ s 2 c i 2 σ w 2 + σ s 2 c i 2
According to the Neyman-Pearson theorem, the threshold is calculated from the probability of false alarm PFA under 0 through the complimentary cumulative distribution function (CDF). The following relationship is used [36]:
P FA = 1 - i = 1 L - 1 λ min udft / 0 λ l udft / 0 N k = 0 d k Γ LN + k , θ λ l udft / 0 Γ LN + k

Threshold θ is calculated for a given PFA with numerical inversion of the function.

The main problem regarding the use of (55), (56) and (58) in a sensing algorithm is the infinite sum. In a practical implementation, the truncation of the infinite sum is unavoidable. In order to calculate the number of needed addends (or equivalently d k coefficients) that will provide a sufficient approximation of the distribution, the following simulation procedure was followed. A large set of 50,000 channels with exponential PDP was produced. The exponential PDP is given by
PDP = exp - λn , for n = 0 , 1 , C max
During the simulation, the used PDP parameters were λ=0.7, Cmax=48. The c i coefficients were calculated using (12) and the eigenvalues λ i udft / 0 were determined using (57). It was concluded that the number of the necessary d k coefficients depends on the spread of the extracted eigenvalues. This means that if the standard deviation of the L eigenvalues is small, then the approximation converges fast to the distribution of (55); otherwise, a very large number of d k coefficients should be calculated. In order to extract an empirical rule for the number of needed coefficients, the ratio of the maximum eigenvalue λ max udft / 0 over the minimum eigenvalue λ min udft / 0 was used as a measure of the eigenvalue spread. For each channel, the values in (55) and (56) were calculated iteratively as k was continuously increasing. In each step, numerical integration of the estimated PDF was performed. When the integration result becomes larger than 0.9999, it is assumed that the approximation has converged to the desired distribution.In Figure 4, the simulation results are presented. It can be seen that in the vast majority of cases, less than 1,000 coefficients are needed for successful convergence. The prediction bounds of the linear fit (using the minimum mean square error (MMSE) technique) for 99.99% confidence level are also provided in Figure 4. It was estimated that based on the simulation, the upper prediction bound is described by the following straight line:
y = 25.26 x + 300.3
Figure 4

Simulation results of the number of coefficients for distribution approximation.

Therefore, if the number of coefficients is estimated using (60), then there will be 99.99% probability that the approximated distribution has successfully converged. It is noted that with the use of the described procedure, a very accurate estimate of the PFA from (58) is achieved with absolute error less than 10-5 for PFA>0.25.

In order to avoid the need for an approximation of an infinite sum, a method of numerical integration of the characteristic function can be used. During this study, a simple fast Fourier transform (FFT)-based algorithm that performs the integration was developed. Let us assume that the energy of the characteristic function is concentrated in the space τ[ -δ δ ]. Then, it is proved that (54) can be accurately approximated by
f ̂ T ( y ) t k = πk δ / 0 = δ e jπk π N FFT φ T ( y / 0 ) nΔτ - δ N
The FFT-length N can be found as an integer with NΔ τ=τmax with τmax a value where the PDF is expected to be practically zero and Δτ = 1 2 δ . Therefore, fast Fourier transforms can be used to approximate with high accuracy the distribution under investigation. The complimentary CDF can be approximated with the trapezoidal numerical integration technique. Thus, for a threshold θ = π k 0 δ , the PFA is given by
P FA n = 0 k 0 π δ f ̂ T ( y ) πk δ / 0 + f ̂ T ( y ) π k + 1 δ / 0 2

Given the fact that based on the aforementioned analysis, the selected threshold θ is also discrete, an approximation of the PFA for any threshold can be calculated using linear interpolation.

3.5 Metric distribution under 1

Under 1 , the interim variable can be defined as
z = Λ - 1 / 2 U H Σ y - 1 y
In this case, the determinant that provides the eigenvalues is given by
det Σ y C - 1 Σ y σ w 2 - χ + 1 C - 1 = det Σ y 2 σ w 2 - χ + 1 I 1 2 C - 1 Σ y 2 σ w 2 - χ + 1 I 1 2 = 0

which leads to χ i = σ s 2 c i 2 σ w 2 .

The calculation of the metric distribution under 1 can be made with the same techniques as before:

  • Using the analytical solution (55) and (56), where the used eigenvalues are λ i udft / 1 = σ s 2 c i 2 σ w 2

  • With FFT-based approximation of the PDF from the characteristic function given by
    φ T y / 1 τ = n = 0 L - 1 1 - j σ s 2 c i 2 σ w 2 τ - N
After the extraction of the metric distribution under 1 and for a given threshold, the probability of correct detection PD can be calculated. Using the analytical solution, the following formula is derived [36]:
P D = 1 - i = 1 L - 1 λ min udft / 1 λ l udft / 1 N k = 0 d k Γ LN + k , θ λ l udft / 1 Γ LN + k

When the truncation of the infinite sum is done using the ratio of the maximum over the minimum eigenvalue and the empirical formula of (60), then the approximation of the PD value is extremely accurate (absolute error less than 10-4).

4 Detector at the OFDM-OQAM receiver output

The candidacy of OFDM-OQAM as a modulation technique for CR system leads inevitably to the need for a detector design for such systems. As mentioned in Section 2, the OFDM-OQAM systems can be assumed to use an MDFT filter bank structured as the block diagrams in Figure 2. The two structures are equivalent and can be used to implement the filtering unit of an OFDM-OQAM demodulator. In order to design the detector, the samples after the real/imaginary separation blocks are collected. At this point, the signal has practically returned to the Nyquist sampling rate. The second structure is selected, which contains two similar parallel uniform DFT banks with maximally decimated output in order to simplify the mathematical formulation of the problem. The two banks are operating with relevant time offset of M/2 symbols. The signal that is led to the detector can be defined as
y 2 i oqam = y 2 i ( A ) + jI y 2 i ( B ) y 2 i + 1 oqam = jI y 2 i + 1 ( A ) + y 2 i + 1 ( B ) i = 0 , 1 ..M / 2
The superscript indicates whether the specific signal is extracted by the first upper bank (A) or the second lower bank (B). Initially, an examination is performed to verify that there is no correlation between the real and imaginary part of the signal. The real/imaginary separation blocks can be expressed as simple linear relationships:
y i ( X ) = y i ( X ) + y i ( X ) 2 , I y i ( X ) = - j y i ( X ) - y i ( X ) 2 X = A , B , i = 0 , 1 M - 1
First, the autocorrelation matrix for each subchannel is calculated. It is noted that the presented analysis is provided for the even channels, but the exact same results are extracted for the odd subchannels with permutation of the (∙) and I(∙) operators:
E y i oqam y i oqam H k , m = E y n oqam, i y n + m - k oqam, i = E y n oqam, i y n + ε oqam, i = E y n ( A, i ) y n + ε ( A, i ) + E I y n ( B, i ) I y n + ε ( B, i ) + j E y n + ε ( A, i ) I y n ( B, i ) - j E y n ( A, i ) I y n + ε ( B, i ) where ( m - k = ε )
Assuming a circular white Gaussian input, the following result is extracted from (18) and (19):
E y n ( A ) y n + ε ( A ) = 1 2 σ x , i 2 δ ε E I y n ( B ) I y n + ε ( B ) = 1 2 σ x , i 2 δ ε with σ x , i 2 = σ w 2 , for 0 c i 2 σ s 2 + σ w 2 , for 1
The investigation of the correlation of the imaginary parts in (69) leads to
E y n + ε ( A, i ) I y n ( B, i ) = E - j y n + ε ( A, i ) + y n + ε ( A, i ) 2 y n ( B, i ) - y n ( B, i ) 2 = j 4 E y n + ε ( A, i ) E y n ( B, i ) - j 4 E y n + ε ( A, i ) E y n ( B, i ) = j 4 u = - p = - h u h p e 2 πj i p - u M E x Mn - u - M 2 x Mn + - p - u = - p = - h u h p e 2 πj i p - u M E x Mn + - u x Mn - p - M 2 = j 4 p = - h p h p - - M 2 e jπi - u = - h u h u - - M 2 e - jπi = 0
In (71), all the terms containing E(x n xn+ε) and E((x n xn+ε)) were omitted since in complex circular normal variables, these terms are zeroed, if the imaginary and real parts have the same variances. The same result is extracted for the remaining term of (69). The combined result is given by
E y i oqam y i oqam H = σ x , i 2 I N
Similarly to the previous analysis, the correlation of the output from non-directly adjacent filter paths is considered zero. The next step is to calculate the cross-correlation between outputs of directly adjacent filters. Assuming that filter path i is even, then i+1 is odd. The exact same procedure can be used for an odd i th filter. Thus,
E y i oqam y i + 1 oqam H = E y i (A) + y i (A) 2 + y i (B) - y i (B) 2 y i + 1 (A) - y i + 1 (A) 2 H + y i + 1 (B) + y i + 1 (B) 2 H = 1 4 E y i (A) y i + 1 (A) H - E y i (A) y i + 1 (A) T + E y i (B) y i + 1 (B) H - E y i (B) y i + 1 (B) T + E y i (B) y i + 1 (A) H + E y i (A) y i + 1 (B) H + E y i (B) y i + 1 (A) T + E y i (A) y i + 1 (B) T
where once more, all the terms that did not contain products between conjugates were ignored. The first finding concerns the first four terms. Since the output from each separate filter bank is the same with the output of a uniform DFT filter bank at Nyquist rate, then the cross-correlation matrix between the outputs of adjacent paths coming from the same filter bank has already been calculated in (22) for white Gaussian input with unitary variance ( N 0 , 1 ). Given that the only difference between filter banks (A) and (B) is a delay offset of the input and that filter paths y i (A) , y i (B) monitor the same spectral band (with the same radio channel coefficient c i ), the output cross-correlations for adjacent subchannels for the two filter banks are equal. Therefore,
E y i (A) y i + 1 (A) H = E y i (B) y i + 1 (B) H = σ x , i σ x , i + 1 R , and given that R is real and symmetric: E y i (A) y i + 1 (A) T = E y i (B) y i + 1 (B) T = σ x , i σ x , i + 1 R H = σ x , i σ x , i + 1 R
where σx,i=σ s |c i |. Therefore, the sum of the first four terms in (73) is zero. Regarding the following four terms, it can be proved after some mathematical manipulation that
E y i ( A ) y i + l ( B ) H k , m = σ x , i σ x , i + l - 1 i + l × u = - h u h u - M 2 + e - 2 πj lu M = σ x , i σ x , i + l - 1 i + l - 1 1 + l 2 j × u = - h u h u - M 2 + sin 2 πu M σ x , i σ x , i + l - 1 i + l - 1 1 + l 2 jg - M 2 sin
This result is achieved using the symmetry of the prototype FIR filter. Matrix T is defined in order to store the outcome for σx,i=1, σx,i+l=1. With unification of the sign manipulation factors, the matrix elements are given by
T i , l k , m = j - 1 i + 1 g M m - k - M 2 sin , l = 1 j - 1 i g M m - k - M 2 sin , l = - 1
Based on (75) and given the fact that T is purely imaginary, it is also concluded that
E y i (A) y i + l (B) T k , m = σ x , i σ x , i + l T i , l k , m = - σ x , i σ x , i + l T i , l k , m E y i + l (B) y i (A) H = σ x , i σ x , i + l T i , l H , E y i + l (B) y i (A) T = - σ x , i σ x , i + l T i , l H
Combining (76) and (??) in (73), the result is given by
E y i oqam y i + 1 oqam H = 0 N
Thus, if the MDFT filter bank output after the operators (∙) and I(∙) is used, then all the signal vectors that participate in the detection procedure are uncorrelated. The observation vector is defined as
y oqam = y 0 oqam T y 1 oqam T y 1 oqam T T
where due to the independence of signals, reordering is not needed. The covariance matrix of yoqam is the following L N×L N matrix:
E y oqam y oqam H = σ x , 0 2 I N 0 N 0 N 0 N σ x , 1 2 I N 0 N 0 N 0 N σ x , L - 1 2 I N
The form of this matrix leads to the pleasant conclusion that the weighted energy detector (with proper scaling for each filter path) is the Neyman-Pearson optimum detector. The metric of the detector is given by
T oqam y = σ s 2 σ w 2 i = 0 L - 1 c i 2 σ s 2 c i 2 + σ w 2 y i ( oqam ) H y i ( oqam )

The metric distribution can be extracted by

  • With the use of the analytical method of (55), (56) and (58) using as eigenvalues the detector weights, i.e.
    λ i oqam / 0 = σ s 2 c i 2 σ w 2 + σ s 2 c i 2 λ i oqam / 1 = σ s 2 c i 2 σ w 2
  • Or using the FFT-based numerical integration with φ T ( y oqam / H m ) ω = i = 0 L - 1 1 - j λ i oqam / m ω - N for the outcomes m=0,1.

In Figure 5, the histogram of the simulated OFDM-OQAM detector metric is compared with the theoretically calculated distribution. Both methods of distribution calculation return practically identical results. A very similar figure can be extracted for the Neyman-Pearson detector for uniform DFT filter banks, since both optimal detectors have identical metric distributions. The results of the two optimum Neyman-Pearson detectors for the uniform DFT and the MDFT filter bank present similar performance since in both cases the maximum possible amount of information is used. The MDFT filter bank uses double computational workload for filtering. However, in most cases for relatively large sample sets and L>3, the matrix multiplications for the computation of the uniform DFT metric lead to heavier computational burden. Therefore, in general, the OFDM-OQAM optimum detection is favourable.
Figure 5

Distribution fit example for the Neyman-Pearson detection metric for an MDFT filter bank.

5 Energy detection in the uniform DFT filter bank

The optimum detector for an MDFT filter bank in Section 4 is proven to be a weighted (per subchannel) energy detector. Although the performance is identical, the uniform DFT optimum detector is much more complicated since it involves multiplications with the matrix C-1. In this section, the use of the weighted energy detector in a uniform DFT is investigated. It can be proved that the weighted energy detector is optimal if R=0; however, this is not possible in a DFT filter bank with a root-Nyquist prototype filter.

The weighted energy detector as a filter bank-based algorithm was presented in [26], where it was assumed that the subchannel filter outputs are uncorrelated and that the metric performance is determined using Gaussian distributions. It is also claimed that the weighted energy detector operation with optimal weights is similar to the maximum ratio combining (MRC) for independent variables; however, the optimal weights are not determined. The MRC consideration is proved to be the correct and optimum approach for the OFDM-OQAM detector in Section 4, where filter outputs are uncorrelated. In this section, an extension and generalization of the weighted energy detector is performed. The subchannel filter outputs are considered correlated, a fact that is inevitable for uniform DFT filter banks. Moreover, accurate and analytic distributions for the metric under 0 and 1 are extracted based on probability theory.

The metric of the weighted energy detector is given by
T ed y = σ s 2 σ w 2 i = 0 L - 1 c i 2 σ s 2 c i 2 + σ w 2 y i H y i = i = 0 L - 1 T i y i
For zero-mean complex Gaussian input, additive white noise and root-Nyquist prototype filter, the output for each subchannel is proved to follow the distributions below:
0 : T i y i G N , σ s 2 c i 2 σ s 2 c i 2 + σ w 2 1 : T i y i G N , σ s 2 c i 2 σ w 2

Since independence between samples from the adjacent filters yi+1 and yi-1 is not possible, the performance of the detector will be inferior to the detector in Section 3. The hysteresis of the detector depends on the transition bandwidth and the roll-off of the prototype filter.

Therefore, Ted(y) is a sum of weighted, correlated gamma variables. In order to extract the metric distribution, it is necessary to calculate the correlation coefficient for the energy between the outputs of two adjacent filter paths. According to [37] (Jensen approximation), it is claimed that for a stream of N pairs of samples of Gaussian variables z k =(zk 1,zk 2) with (μ=0,σ=1) that are mutually correlated (but each one has uncorrelated time samples), then the correlation of the energies u 1 = k = 0 N - 1 z k 1 2 , u 2 = k = 0 N - 1 z k 2 2 can be calculated by
p u 1 u 2 = 1 N n = 0 N - 1 q n 2

where the q n s are the normal correlations for variables (zk 1,zk 2). Jensen’s result is valid for real random variables with standard normal distribution. However, it can easily be proved through the correlation coefficient that the same formula is valid for 2N-length real normal variables with μ=0,σ2=1/2. Since a N-complex normal vector is equivalent with a 2N-real vector, the Jensen’s corollary can be used for the current analysis.

Normal correlations are the means to quantify the linear relationship between two multivariate random variables. The normal correlations can be calculated if the joint covariance matrix of the two random variables is known. Specifically, for known covariance matrix,
C x 1 x 1 C x 1 x 2 C x 2 x 1 C x 2 x 2 , for the variables x 1 , x 2
the normal correlation squares are given as the eigenvalues of the matrix:
C x 1 x 1 - 1 C x 1 x 2 C x 2 x 2 - 1 C x 2 x 1 w x = q x 1 x 2 2 w x C x 2 x 2 - 1 C x 2 x 1 C x 1 x 1 - 1 C x 1 x 2 w y = q x 1 x 2 2 w y
where wx,y are the respective eigenvectors. The problem is to calculate the correlation coefficient between the energies of N output samples from adjacent filter banks. The covariance matrix y i ,yi+1 is given by (Section 3):
E y i H y i + 1 H y i y i + 1 = σ s 2 c i 2 I N c i c i + 1 R c i c i + 1 R H c i + 1 2 I N
Given that R is hermitian, it can be proved from (86) that the vector q y i yi+12 is also the vector of eigenvalues of matrix R2. The correlation coefficient can be extracted as the sum of the squares of normal correlations. Since the matrix trace (Tr) is equal to the sum of the eigenvalues, it is proved that
Tr R 2 = n = 0 N - 1 q y i y i + 1 , n 2

The correlation coefficient is equal to the mean of the R2 eigenvalues, i.e. p y i y i + 1 = Tr R 2 / N

Another important note is that since the correlation coefficient does not depend on the radio channel coefficients, it is the same for every pair of adjacent subchannel outputs. It is also noted that for non-directly adjacent subchannels, the correlation coefficient is assumed to be zero. Once again, the analysis in [36] can be followed in order to extract the metric distribution. According to [36], if u i i = 1 L - 1 is a set of L-correlated gamma variables with equal degrees of freedom and known correlation coefficients, then the PDF can be expressed analytically. Unlike the results in Sections 3 and 4 where an identity correlation matrix is considered, in this case, the positive definite matrix Ced that expresses the correlations is given by [36]
C ed = 1 p 0 0 p 1 p 0 p 1 0 p 0 0 p 1
The tridiagonal matrix is an L×L matrix. As a next step, the diagonal matrix Ded is defined according to the rule:
D ed = diag σ s 2 c 0 2 σ s 2 c 0 2 + σ w 2 σ s 2 c L - 1 2 σ s 2 c L - 1 2 + σ w 2 , for 0 D ed = diag σ s 2 c 0 2 σ w 2 σ s 2 c L - 1 2 σ w w , for 1
The distributions are calculated by (55), (56), (58) and (66) using the eigenvalues λ i ed / 0 and λ i ed / 1 that are calculated from the matrix: Aed=DedCed. Since Aed is tridiagonal, the eigenvalues can be calculated iteratively [38]. A distribution fit example for the weighted energy detector metric is presented in Figure 6.
Figure 6

Distribution fit example for the weighted energy detector matrix for uniform DFT filter bank.

In [26], it is mentioned that for uncorrelated, independent subchannel filter outputs, the weighted energy detector can be seen as an approximation of the matched filtering. This is accurate for the OFDM-OQAM Neyman-Pearson (NP) detector where subchannel independence is proved. More specifically, if the ‘approximately flat radio channel per subchannel’ assumption is valid and the radio channel can be adequately described by the c i parameters, then the matched filter approximation is exceptional. As the channel frequency selectivity increases, the deviation from the matched filter performance also increases. However, in the common case of correlated filter outputs, the deviation from the matched filter performance is significant. Since the weighted energy detector metric ignores the correlation of the output samples, it fails to perfectly align the decision metrics in order to maximize probability of detection. This is achieved by the NP optimal detector of Section 3. In terms of diversity, the weighted energy detector is transformed into an non-optimal MRC that ignores the existed correlation among the diversity branches. Despite the fact that the weighted energy detector is outperformed by the NP detector, the selection of weights that depends on the SNR per subchannel provides significant advantages over the conventional energy detector. The integration of the radio channel effects in the detector with the use of the c i parameters is essential, despite the fact that it is based on the ‘approximately flat radio channel’ approximation. Thus, the performance degradation of the weighted energy detector from the NP optimal detector is much smaller than the achieved improvement from the performance of the conventional energy detector, as presented in Figure 7.
Figure 7

ROC curve P D vs. P FA for detection under AWGN.

6 Coloured noise

An important weakness of many detectors is that they are not robust in the existence of coloured noise. Coloured noise may be the result of interference caused by remote PSs or CRs, it may be caused by various electronic noise sources or it may appear due to filter leakage and spurious emissions of users operating in adjacent spectrum bands [5]. In this section, additive coloured Gaussian noise is assumed. In AWGN models, the noise samples are uncorrelated. Coloured noise can be on the other hand modelled as the result of filtering AWGN samples. When the noise reaches the receiver, it is subjected also to filtering from the filter bank. Similarly to the assumption regarding the primary signal, the noise variance is considered approximately constant for the bandpass zone of each filter path. Therefore, the coloured noise modelling can be performed with the following relationships:
S cw f = S ww f V f 2 H f - f i 2 S cw f σ w 2 V f 2 H f - f i 2
where S c w is the PSD of the coloured noise, S w w is the AWGN PSD, V(f) is the transfer function that colours the noise, H(f) is the prototype filter transfer function for the filter bank. Similarly to the assumption for frequency selective channels expressed in (11), it can be assumed that the additive noise at the output of each filter of the bank is also white with variance given by
σ w , i 2 = σ w 2 V f i BW - H f - f i 2 df

where BW is the overall bandwidth.

Coloured noise may be the result of the following: (a) out-of-band emissions and adjacent channel interference, (b) aliasing effects and (c) non-uniform distribution of interferences from remote cells and access points. Filter bank-based sensing can robustly detect signals under coloured noise. The diagonal matrix Σ w can be defined that contains the (assumed constant) noise variance per subchannel. For the uniform DFT Neyman-Pearson detector, the matrix Σ w is defined as
Σ w = Σ w ( 0 ) 0 0 Σ w ( 1 ) , where Σ w ( 0 ) = diag σ w , 0 I N σ w , 2 I N σ w , L - 2 I N Σ w ( 1 ) = diag σ w , 1 I N σ w , 3 I N σ w , L - 1 I N
Under these circumstances, the standard deviation matrix Σ y for the incoming signal under 1 is given by Σ y = Σ 2 + Σ w 2 1 / 2 . The detection metric can be written as
T y = y H C w - 1 - C y - 1 y = = y H Σ w - 1 C - 1 + Σ w Σ y - 1 C - 1 Σ y - 1 Σ w Σ w - 1 y

The result in (94) shows that with simple weighting of the observation samples by y = Σ w - 1 y , the problem is transformed to the equivalent Neyman-Pearson detector with AWGN. More specifically, the equivalent AWGN problem is defined with σ w 2 = 1 and c i = c i σ w , i .

7 Practical implementation of the detectors

7.1 The locally most powerful test

The main disadvantage of the sensing techniques described in the previous sections is that the detector should know the signal variance for each subchannel (the received signal power and the channel coefficient). In real-world implementations, the optimal detectors can be approximated with the use of estimates; however, these detectors are only optimal asymptotically. In case the information for the signal variance is missing or primarily when the subchannel variances are extremely small (linearly expressed SNR →0), then the locally most powerful test can be used for detection. A composite detection problem is considered to have a uniformly LMP detector, when both the metric and the threshold for a given PFA do not depend on unknown parameters (in this case the variances). Unfortunately, these cases are very rare.

In this section, the LMP detector is formed for a uniform DFT filter bank. The observation vector is defined as in (5) but the binary problem is now defined as follows:
For: 0 : y = w 0 w L - 2 | w 1 w L - 1 T For: 1 : y = θ 0 s 0 + w 0 θ L - 2 s L - 2 + w L - 2 | θ 1 s 1 + w 1 θ L - 1 s L - 1 + w L - 1 T ( θ = θ 0 θ L - 2 | θ 1 θ L - 1 )
The noise is defined as in the previously described detectors. On the other hand, the signals s i are considered standard complex normal variables. Each signal is multiplied with a θ i parameter close to zero. Due to the filtering, the outputs of the adjacent subchannels are correlated through the matrix C (24). The binary problem is formulated as
0 : θ = 0 L , 1 1 : θ > 0 L , 1
where the vector inequality has the following meaning: If there is a primary signal in the specific subchannels, it should be θ i >0 for all i=0,1…L-1. Using the procedure defined in [24, 39], it is found that since the vector θ contains a set of L parameters, the extraction of the LMP test becomes extremely complicated. This problem can be bypassed using a simple consideration. Since θ values are extremely small (near to zero), they can be assumed as approximately equal and therefore, a scalar parameter θ common for all the subchannel outputs can be used. This is also verified by the fact that the LMP tests for simple structures (e.g. two filters, one sample per filter for the decision) are identical either if L parameters or a single parameter is assumed. Thus, the binary problem is simplified:
0 : θ = 0 1 : θ > 0
According to Section 3 and using the common scalar parameter θ, the observation vector distributions are given by
0 : y N 0 , C w = σ w 2 C 1 : y N 0 , C y = Σ C Σ + σ w 2 C = θ 2 + σ w 2 C
Since θ→0, the PDF can be approximated using the Taylor series for θ(0)=0:
ln f y ; θ / 1 ln f y ; θ = 0 / 1 + θ ln f y ; θ / 1 ∂θ θ = 0 + θ 2 2 2 ln f y ; θ / 1 θ 2 θ = 0
where only the two first terms of the series are kept. It is proved using ln f y ; θ = 0 / 1 = ln f y / 0 that
ln f y ; θ / 1 ln f y / 0 - NL σ w 2 + 1 σ w 2 y H C - 1 y
Therefore, the detector decides using the following inequality:
T lmp y = y H C - 1 y 0 1 υ = σ w 2 ln υ + NL
With the definition of the interim variable z as in (45), it can be proved that
T lmp y = σ w 2 z H Λ 1 / 2 U H C - 1 U Λ 1 / 2 z = σ w 2 z H z
which means that t = T lmp y / 0 G NL , σ w 2 and the PFA is provided by
P FA υ = 1 - γ NL , υ σ w 2 Γ NL

Since θ remains unknown, the accurate calculation of PD is not possible for the LMP test.

The prescribed procedure can be followed for the extraction of the LMP detector for MDFT filter banks. In this case, the covariance matrix is approximated by
C oqam = σ w 2 + θ 2 I NL
and the LMP metric is given by
T lmp y oqam = y oqam H y oqam 0 1 υ = σ w 2 ln υ + NL

which is the simple energy detector. The PFA can be calculated from (103) with σ w =1. Therefore, the MDFT filter bank has a uniformly LMP test.

7.2 The GLRT detector

In a real-world implementation of the Neyman-Pearson detectors, the CR receiver is assumed to have no knowledge regarding the primary signal. In this section, an approximation of the optimal detectors using estimates is attempted. The receiver is assumed to know the noise power and the distribution family (zero mean complex Gaussian) for the primary signal under 1 . This is a composite hypothesis test since the PDF under 1 depends on L unknown parameters. The LMP, although it ensures constant PFA, does not fully exploit the available information and it does not provide information or control over the achieved PD. Another approach is the Generalized Likelihood Ratio Test - GLRT. The GLRT decides using the log-likelihood ratio (as in the Neyman-Pearson detectors) and the maximum likelihood estimates (MLE) of the unknown distribution parameters.
L G y = f y / θ ̂ , 1 f y / 0 , where f y / θ ̂ ,