# Suppression of Mutual Interference in Noncontiguous Orthogonal Frequency Division Multiplexing Based Cognitive Radio Systems

Authors: Atif Elahi; Ijaz Mansoor Qureshi; Fawad Zaman; Noor Gul; Tahir Saleem
Journal: Wireless Communications and Mobile Computing
 (2017)

---

## Abstract

Orthogonal frequency division multiplexing (OFDM) is a favourable technology for dynamic spectrum access (DSA) due to the flexibility in spectrum shaping. In spite of that, high sidelobes of OFDM subcarriers bring in considerable interference to the nearby users, particularly in OFDM based cognitive radio (CR) networks, where the secondary users (SUs) are capable of accessing the spectrum opportunistically. In this paper, two new techniques for the suppression of high sidelobes are proposed. The proposed techniques composed of an optimization scheme are followed by generalized sidelobe canceller. The proposed techniques can be considered as a two-level suppression technique in the sense that in the first level the sidelobe is reduced by using cancellation carriers (CCs), whose amplitudes are determined using genetic algorithm (GA) and differential evolution (DE), while in the second level further reduction of sidelobe is achieved using generalized sidelobe canceller (GSC). Simulation results show the power spectral density (PSD) performance of the proposed techniques in comparison with already existing techniques, demonstrating that the proposed techniques minimize the out-of-band radiation (OOBR) significantly, thus qualifying for more effective spectrum sharing.


---

## Body

## 1. Introduction

To tackle the problem of spectrum overcrowding, Mitola [1–3] was the first to give the concept of cognitive radio (CR). The philosophy of CR is to search for an inactive spectrum at a certain time and localities, dynamically, and try to use them in such a way that the secondary user cannot interfere with the licensed users (LUs). Orthogonal frequency division multiplexing (OFDM), considered as the perfect candidate for CR [4–6], can divide the total available bandwidth into a number of orthogonal subbands and deactivate specific subcarriers.Some advantages of OFDM include spectral efficiency, resistivity against frequency selective fading, protection against interference, and simpler channel equalization. However, due to the high sidelobes of the OFDM subcarriers, CR based OFDM experience high out-of-band radiation (OOBR) that may interfere with either LUs or secondary users (SUs) in the contiguous bands. Different techniques including cancellation carriers (CCs) [7, 8], CC using genetic algorithm (GA) and differential evolution (DE) [9], active and null cancellation carriers (ANCC) [10], advanced cancellation carriers (ACC) [11], advanced subcarrier weightings (ASW) [12], subcarrier weightings (SW) [13], filtering [14], windowing [15, 16], adaptive symbol transition (AST) [17], active interference cancellation (AIC) [18–20], insertion of guard bands [21, 22], multiple choice sequence (MCS) [23], spectral precoding schemes [24–28], constellation expansion (CE) [29–31], and sidelobes reduction using generalized sidelobe canceller (GSC) [32] are proposed to address the OOBR problem. These techniques undergo different penalties; therefore, proper hybridization of two or more techniques may result in a better OOBR reduction.In this paper, we propose two new techniques: GSC combined with CC using GA and GSC combined with CC using DE. In these new techniques, the sidelobes are reduced into two steps. In the first step, CCs are added to the original OFDM signal, where the amplitudes of CCs have been adjusted using GA and DE [9], respectively, while in the second step the signal is then passed through GSC [32, 33] for further reduction of sidelobes.The remainder of the paper is organized as follows. In Section2, we discuss the system model. In Section 3, a brief discussion of our proposed techniques is given. Section 4 is about the simulation results, while in Section 5 conclusion about the paper is given.Notation. · H, ·T, and ·-1 represent the Hermitian, transpose, and inverse, while E[·] represents the expectation. Small bold letter represents a vector, the capital bold letter represents matrix, and I represents the identity matrix while O represents the null matrix.


## 2. System Model

Consider an OFDM system having a total ofM secondary users (SUs) opportunistically using a spectrum not utilized by a LU, which is identified with the help of spectrum sensing techniques. The total available spectrum is divided into N subcarriers out of which Ns subcarriers are utilized byith SU, such that Ns⊆N. The baseband OFDM signal for ith SU is given by(1)xit=∑n=0Ns-1qn,iej2πfntIt,where xi(t) represents the OFDM signal of ith SU, qn,i represents the modulated symbol on nth subcarrier, and fn=n/T, n=0,1,…,Ns, represents the subcarrier frequencies, while I(t) represents the rectangular function defined as(2)It=1-Tg≤t≤T0otherwise,where Tg represents the guard interval length used for the elimination of intersymbol interference (ISI) and T represents the symbol duration.After taking the Fourier transformation of the signal given in (1), we get(3)Xf=∑n=0Ns-1qn,isin⁡cπf-fnTs,where Ts=T+Tg represents the symbol duration, while sin⁡cx=sin⁡x/x.The signal in (3) is SU signal in frequency domain, whose sidelobe power in frequency bands of the adjacent LUs decays with 1/f2Ns as shown in Figure 1, resulting in high OOBR. To protect those adjacent LUs from the OOBR of SUs, the sidelobes should be suppressed efficiently.Figure 1
Spectrum of transmitted OFDM signal.


## 3. The Proposed Methodologies

In this section, we present our two new techniques for suppression of sidelobes. The proposed technique I includes a combination of GSC with CC using GA, while the proposed technique II includes a combination of GSC with CC using DE. In both of these proposed techniques, the sidelobe suppression is done in two steps.


### 3.1. Step I

The first step involves the suppression of sidelobes using CCs, whose amplitudes are calculated using GA in our first proposed methodology and using DE in our second proposed methodology. The concept of GA was first given by Holland [34] in the early 1970s and in late 1980s by Goldberg [35]. The main steps of GA in the form of pseudocode are given as follows:Start
Randomly generate a set of candidate solutions (i.e., set of chromosomes).Compute the fitness of each candidate solution in the current population.Repeat
Select the parents in the order of their fitness.Produce the offspring using crossover (single point crossover,  multiple point crossover).Offspring for the new generation is selected using one of three methods, that is, Elitism.Replace generation and survival of fitness.If no improvement is found in the new generation, then do mutation.All the offspring will be the new population; the parents will die.Until a stop condition is satisfied.End.The basic idea behind GA comes from Darwin’s theory of evolution, randomly generating a set of “chromosomes” and then allowing for the process of “natural selection” and “genetic drift” to occur to develop the “chromosome” into the most appropriate contestant for “survival.” Every “chromosome” is the only probable solution of the problem being solved, and the “natural selection” is a method of crossover where some qualities of better performing “chromosomes” are combined with the qualities of other “chromosomes” for the production of the next generation. Next is the “genetic drift,” a kind of mutation of a “chromosome” that is usually represented by a probability which dictates the chance of random mutation in the form of inversion of a bit or a similar random change to the “chromosome.” GA has the capability of finding a good solution to a problem where the iterative solution takes too much time and its solution is not achievable. Another significance of using GA is that there are many problems with many different constraints based on the specific of the solution for which one is searching. Another strength of genetic algorithm’s approach is that there exists a proof of convergence for an elitist version of the genetic algorithm. Although the theory of the GA is not very complex, the single parameters and execution of the GA generally need a large amount of tuning.The concept of DE was first given by Stone and Price [36, 37]. The technique of DE is the same as GA; it can be applied to real-valued problems over a continuous space with much more simplicity than a GA. The idea behind the method of DE is that the difference between two vectors yields a difference vector which can be used with a scaling factor to traverse the search space. The procedural step of DE in the form of pseudocode is given as follows:Start
Randomly generate the initial population.Compute the fitness of the initial population.Repeat
Select three different solutions randomly.Create one offspring using the DE operators.Do this a number of times equal to the population size.For each member of the next generation,ifoffspring(x) is more fit than parent(x),Parent(x) is replaced.Until a stop condition is satisfied.End.The strength of DE methodology is that it regularly shows better results than GA and other evolutionary algorithms (EAs). DE is simple and straightforward and can be easily applied to a widespread range of real-valued problems in spite of noisy, multimodal, multidimensional spaces, which usually make the problems very difficult for optimization. Another extraordinary feature of DE is that the parameters such as crossover rate and mutation do not need the same fine tuning which is required in many other EAs.


#### 3.1.1. Concept of Cancellation Carriers

As discussed earlier, the total number of available subcarriers isN, out of which Ns subcarriers are used by the ith SU for its data transmission and carry modulated symbols qn,i∈qi=q1,i,q2,i,…,qNs,iT. The remaining N-Ns subcarriers are not used for data transmission but act like guard carriers. As an alternative of guard carriers, K=Kl+Kr CCs are inserted on either side of the used OFDM signal of ith SU as shown in Figure 2, where Kl and Kr represent left and right sided CCs. These CCs are not used to carry the data but complex weights, that is, the amplitude of main lobe of CCs ak∈a=a1,a2,…,aKT that should be adjusted in such a way that their sidelobes cancel the sidelobes of the OFDM signal of the ith SU in a certain defined space called optimization space. The transmitted symbol vector now consists of Ns data symbols and K weights of CCs and is normalized in such a way that the power of transmitted OFDM signal of ith SU with CCs is the same as without CCs. The spectrum of the kth CC is given by(4)ckα=aksin⁡cπα-λk,k=1,2,…,K,where α=f-foTs, while λk representing the normalized centre frequency of the kth CC that lies on either side of the OFDM spectrum of ith SU is given as(5)λk=f1-k-foTsk=1,2,…,KlfNs+k-Kl-foTsk=Kl+1,…,K.Now, the transmitted OFDM signal of ith SU with CCs in frequency domain is given by(6)Tf=∑k=0K/2-1aksin⁡cπα-λk+∑n=0Ns-1qn,isin⁡cπf-fnTs+∑k=K/2K-1aksin⁡cπα-λk.To calculate the weights ak∈a=a1,a2,…,aKT of the CCs, GA and DE have been proposed which are based on our fitness function.Figure 2
Concept of cancellation carriers.


#### 3.1.2. Fitness Function

The concept behind our proposed fitness function is that weights of CCs are calculated using the average of all samples. These samples are taken as the centre of each sidelobe for reducing the computational complexity and reduction of memory usage. Suppose the total number of samples taken on both sides of the OFDM signal isM. The result of the final fitness function is the average sidelobe power value of all samples given by(7)ACj=∑m1=0K/2-1Am1,jam1+∑m2=K/2K-1Am2,jam2,(8)ADj=∑n=0Ns-1An,jdi,n,j=1,2,…,M.In (7), Am1,jrepresents the sidelobe level of m1th left CC at the jth sample, Am2,i represents the sidelobe level of m2th right CC at the jth sample, and am1 and am2 represent the weights of the main lobe of the m1th left and m2th right CC. In (8), An,j represents the sidelobe power level of nth data subcarrier at jth sample and di,n represents the weight of the main lobe of nth data subcarrier. Finally, the total sidelobe power level at jth sample from the data subcarriers and CCs is given by(9)Aj=ADj+ACj.On putting the values of ADj and ACj from (7) and (8) in (9), we obtain the following:(10)Aj=∑m1=0K/2-1Am1,jam1+∑n=0Ns-1An,jdi,n+∑m2=K/2K-1Am2,jam2.The final fitness will now become(11)A=1M∑j=1MAj.


### 3.2. Step II

In the second step, the samples of the signal with optimized CCs given in (6) are collected into a vector b=b0,b1,…,bW-1T, having dimension W×1 whose elements are uncorrelated. The vector b is taken to the GSC for further suppression of sidelobes. GSC is a substitute to express the notion that the linearly constrained minimum variance (LCMV) problem can provide an understanding, is very effective for investigation, and can make the LCMV beamforming easier. It also provides the relationship between the multiple sidelobe canceller (MSC) and LCMV beamforming. GSC is a method of converting the constrained minimization problem into an unconstrained one. The block diagram of GSC is shown in Figure 3, which consists of two portions: the upper portion and the lower portion. The upper portion is the main part of GSC, which consists of quiescent weight vector xq that maintains the signal of the SU that is here in this case the signal of ith SU, and gives an essential gain to the desired part of the signal that is the part of the signal from f1 to fNs fulfilling the constraints as depicted in Figure 2.Figure 3
Block diagram of GSC.The lower portion of the GSC comprises blocking matrixCa which stops the desired part of the signal and keeps the sidelobes, that is, f<f1 and f>fNs, portion of the signal depicted in Figure 2 and an adaptive weight vector xa that alters the weights of sidelobes. Finally, the signals from the upper portion and lower portion are subtracted from each other, resulting in the further reduction of sidelobes.The output of GSC after passing vectorb is given by [32, 33](12)Z=xHb,where xH=xqH-xaHCaH and its dimension is 1×W.The weight vectorxH=xqH-xaHCaH that minimizes the output power of (12) with multiple linear constraints using LCMV is given by(13)minxxHRx,s.t.xHC=fH.Its solution is given by(14)xoH=fHCHRC-1CHR-1,where(15)R=EbbH=σb2…0⋮⋱⋮0…σb2represents the correlation matrix having dimension W×W, σb2 represents the variance, and C represents the W×Ns constraint matrix, having Ns steering vectors given by (16)C=s1,s2,…,sNs,where Ns represents the frequency number in the defined portion of the signal shown in Figure 2. sj=s1,s2,…,sWT is a jth steering vector having dimension W×1, which contains W samples of the jth spectrum, while f=1,1,…,1T representing the gain vector having dimension Ns×1 contains gain associated with each steering vector.The useful implementation of LCMV is the division ofW-dimensional space into constraint subspace defined by columns ofC and orthogonal subspace defined by columns of Ca. Thus,(17)CHCa=O,where O is the null matrix having dimension N×(W-Ns) and Ca is the blocking matrix having dimension W×(W-Ns).Now, consider the partition ofxoH into two orthogonal components(18)xoH=xcH-xPH,where xcH is the projection of xoH onto the constraint subspace and xPH is the projection of xoH onto the orthogonal subspace. The projection matrices onto the constraint and orthogonal subspace both having dimension W×W are given by(19)Pc=CCHC-1CH,(20)Po=CaCaHCa-1CaH.So, therefore,(21)xcH=xoHPc,(22)xPH=xoHPo.On putting (14) and (19) into (21), we get(23)xcH=fHCHC-1CH≜xqHdefined as the quiescent weight vector with dimension 1×W. Also, putting (14) and (20) into (22) gives(24)xPH=fHCHR-1C-1CHR-1CaCaHCa-1CaH.Equation (24) is correct but is not particularly useful, so it is suggested to be divided into two portions. The first portion contains Ca, the blocking matrix, while the second portion contains xa, the adaptive weight vector having dimension W-Ns×1. For obtaining the blocking matrix Ca, we will first find Po using(25)Po=I-Pcand orthonormalizing Po and then taking the first W-Ns columns of the orthonormalized matrix, resulting in the blocking matrix Ca with the following property:(26)CaHCa=I.For adaptive weight vector xa substituting xH=xqH-xaHCaH in (12),(27)Z=xqH-xaHCaHb.The power output is(28)P=xqH-xqHCqHRxq-Caxa.Taking gradient of (28) with respect to xa and setting the results equals to zero, we get an optimum adaptive weight vector x^aH given by(29)x^aH=xqHRCaCaHRCa-1.


## 3.1. Step I

The first step involves the suppression of sidelobes using CCs, whose amplitudes are calculated using GA in our first proposed methodology and using DE in our second proposed methodology. The concept of GA was first given by Holland [34] in the early 1970s and in late 1980s by Goldberg [35]. The main steps of GA in the form of pseudocode are given as follows:Start
Randomly generate a set of candidate solutions (i.e., set of chromosomes).Compute the fitness of each candidate solution in the current population.Repeat
Select the parents in the order of their fitness.Produce the offspring using crossover (single point crossover,  multiple point crossover).Offspring for the new generation is selected using one of three methods, that is, Elitism.Replace generation and survival of fitness.If no improvement is found in the new generation, then do mutation.All the offspring will be the new population; the parents will die.Until a stop condition is satisfied.End.The basic idea behind GA comes from Darwin’s theory of evolution, randomly generating a set of “chromosomes” and then allowing for the process of “natural selection” and “genetic drift” to occur to develop the “chromosome” into the most appropriate contestant for “survival.” Every “chromosome” is the only probable solution of the problem being solved, and the “natural selection” is a method of crossover where some qualities of better performing “chromosomes” are combined with the qualities of other “chromosomes” for the production of the next generation. Next is the “genetic drift,” a kind of mutation of a “chromosome” that is usually represented by a probability which dictates the chance of random mutation in the form of inversion of a bit or a similar random change to the “chromosome.” GA has the capability of finding a good solution to a problem where the iterative solution takes too much time and its solution is not achievable. Another significance of using GA is that there are many problems with many different constraints based on the specific of the solution for which one is searching. Another strength of genetic algorithm’s approach is that there exists a proof of convergence for an elitist version of the genetic algorithm. Although the theory of the GA is not very complex, the single parameters and execution of the GA generally need a large amount of tuning.The concept of DE was first given by Stone and Price [36, 37]. The technique of DE is the same as GA; it can be applied to real-valued problems over a continuous space with much more simplicity than a GA. The idea behind the method of DE is that the difference between two vectors yields a difference vector which can be used with a scaling factor to traverse the search space. The procedural step of DE in the form of pseudocode is given as follows:Start
Randomly generate the initial population.Compute the fitness of the initial population.Repeat
Select three different solutions randomly.Create one offspring using the DE operators.Do this a number of times equal to the population size.For each member of the next generation,ifoffspring(x) is more fit than parent(x),Parent(x) is replaced.Until a stop condition is satisfied.End.The strength of DE methodology is that it regularly shows better results than GA and other evolutionary algorithms (EAs). DE is simple and straightforward and can be easily applied to a widespread range of real-valued problems in spite of noisy, multimodal, multidimensional spaces, which usually make the problems very difficult for optimization. Another extraordinary feature of DE is that the parameters such as crossover rate and mutation do not need the same fine tuning which is required in many other EAs.


### 3.1.1. Concept of Cancellation Carriers

As discussed earlier, the total number of available subcarriers isN, out of which Ns subcarriers are used by the ith SU for its data transmission and carry modulated symbols qn,i∈qi=q1,i,q2,i,…,qNs,iT. The remaining N-Ns subcarriers are not used for data transmission but act like guard carriers. As an alternative of guard carriers, K=Kl+Kr CCs are inserted on either side of the used OFDM signal of ith SU as shown in Figure 2, where Kl and Kr represent left and right sided CCs. These CCs are not used to carry the data but complex weights, that is, the amplitude of main lobe of CCs ak∈a=a1,a2,…,aKT that should be adjusted in such a way that their sidelobes cancel the sidelobes of the OFDM signal of the ith SU in a certain defined space called optimization space. The transmitted symbol vector now consists of Ns data symbols and K weights of CCs and is normalized in such a way that the power of transmitted OFDM signal of ith SU with CCs is the same as without CCs. The spectrum of the kth CC is given by(4)ckα=aksin⁡cπα-λk,k=1,2,…,K,where α=f-foTs, while λk representing the normalized centre frequency of the kth CC that lies on either side of the OFDM spectrum of ith SU is given as(5)λk=f1-k-foTsk=1,2,…,KlfNs+k-Kl-foTsk=Kl+1,…,K.Now, the transmitted OFDM signal of ith SU with CCs in frequency domain is given by(6)Tf=∑k=0K/2-1aksin⁡cπα-λk+∑n=0Ns-1qn,isin⁡cπf-fnTs+∑k=K/2K-1aksin⁡cπα-λk.To calculate the weights ak∈a=a1,a2,…,aKT of the CCs, GA and DE have been proposed which are based on our fitness function.Figure 2
Concept of cancellation carriers.


### 3.1.2. Fitness Function

The concept behind our proposed fitness function is that weights of CCs are calculated using the average of all samples. These samples are taken as the centre of each sidelobe for reducing the computational complexity and reduction of memory usage. Suppose the total number of samples taken on both sides of the OFDM signal isM. The result of the final fitness function is the average sidelobe power value of all samples given by(7)ACj=∑m1=0K/2-1Am1,jam1+∑m2=K/2K-1Am2,jam2,(8)ADj=∑n=0Ns-1An,jdi,n,j=1,2,…,M.In (7), Am1,jrepresents the sidelobe level of m1th left CC at the jth sample, Am2,i represents the sidelobe level of m2th right CC at the jth sample, and am1 and am2 represent the weights of the main lobe of the m1th left and m2th right CC. In (8), An,j represents the sidelobe power level of nth data subcarrier at jth sample and di,n represents the weight of the main lobe of nth data subcarrier. Finally, the total sidelobe power level at jth sample from the data subcarriers and CCs is given by(9)Aj=ADj+ACj.On putting the values of ADj and ACj from (7) and (8) in (9), we obtain the following:(10)Aj=∑m1=0K/2-1Am1,jam1+∑n=0Ns-1An,jdi,n+∑m2=K/2K-1Am2,jam2.The final fitness will now become(11)A=1M∑j=1MAj.


## 3.1.1. Concept of Cancellation Carriers

As discussed earlier, the total number of available subcarriers isN, out of which Ns subcarriers are used by the ith SU for its data transmission and carry modulated symbols qn,i∈qi=q1,i,q2,i,…,qNs,iT. The remaining N-Ns subcarriers are not used for data transmission but act like guard carriers. As an alternative of guard carriers, K=Kl+Kr CCs are inserted on either side of the used OFDM signal of ith SU as shown in Figure 2, where Kl and Kr represent left and right sided CCs. These CCs are not used to carry the data but complex weights, that is, the amplitude of main lobe of CCs ak∈a=a1,a2,…,aKT that should be adjusted in such a way that their sidelobes cancel the sidelobes of the OFDM signal of the ith SU in a certain defined space called optimization space. The transmitted symbol vector now consists of Ns data symbols and K weights of CCs and is normalized in such a way that the power of transmitted OFDM signal of ith SU with CCs is the same as without CCs. The spectrum of the kth CC is given by(4)ckα=aksin⁡cπα-λk,k=1,2,…,K,where α=f-foTs, while λk representing the normalized centre frequency of the kth CC that lies on either side of the OFDM spectrum of ith SU is given as(5)λk=f1-k-foTsk=1,2,…,KlfNs+k-Kl-foTsk=Kl+1,…,K.Now, the transmitted OFDM signal of ith SU with CCs in frequency domain is given by(6)Tf=∑k=0K/2-1aksin⁡cπα-λk+∑n=0Ns-1qn,isin⁡cπf-fnTs+∑k=K/2K-1aksin⁡cπα-λk.To calculate the weights ak∈a=a1,a2,…,aKT of the CCs, GA and DE have been proposed which are based on our fitness function.Figure 2
Concept of cancellation carriers.


## 3.1.2. Fitness Function

The concept behind our proposed fitness function is that weights of CCs are calculated using the average of all samples. These samples are taken as the centre of each sidelobe for reducing the computational complexity and reduction of memory usage. Suppose the total number of samples taken on both sides of the OFDM signal isM. The result of the final fitness function is the average sidelobe power value of all samples given by(7)ACj=∑m1=0K/2-1Am1,jam1+∑m2=K/2K-1Am2,jam2,(8)ADj=∑n=0Ns-1An,jdi,n,j=1,2,…,M.In (7), Am1,jrepresents the sidelobe level of m1th left CC at the jth sample, Am2,i represents the sidelobe level of m2th right CC at the jth sample, and am1 and am2 represent the weights of the main lobe of the m1th left and m2th right CC. In (8), An,j represents the sidelobe power level of nth data subcarrier at jth sample and di,n represents the weight of the main lobe of nth data subcarrier. Finally, the total sidelobe power level at jth sample from the data subcarriers and CCs is given by(9)Aj=ADj+ACj.On putting the values of ADj and ACj from (7) and (8) in (9), we obtain the following:(10)Aj=∑m1=0K/2-1Am1,jam1+∑n=0Ns-1An,jdi,n+∑m2=K/2K-1Am2,jam2.The final fitness will now become(11)A=1M∑j=1MAj.


## 3.2. Step II

In the second step, the samples of the signal with optimized CCs given in (6) are collected into a vector b=b0,b1,…,bW-1T, having dimension W×1 whose elements are uncorrelated. The vector b is taken to the GSC for further suppression of sidelobes. GSC is a substitute to express the notion that the linearly constrained minimum variance (LCMV) problem can provide an understanding, is very effective for investigation, and can make the LCMV beamforming easier. It also provides the relationship between the multiple sidelobe canceller (MSC) and LCMV beamforming. GSC is a method of converting the constrained minimization problem into an unconstrained one. The block diagram of GSC is shown in Figure 3, which consists of two portions: the upper portion and the lower portion. The upper portion is the main part of GSC, which consists of quiescent weight vector xq that maintains the signal of the SU that is here in this case the signal of ith SU, and gives an essential gain to the desired part of the signal that is the part of the signal from f1 to fNs fulfilling the constraints as depicted in Figure 2.Figure 3
Block diagram of GSC.The lower portion of the GSC comprises blocking matrixCa which stops the desired part of the signal and keeps the sidelobes, that is, f<f1 and f>fNs, portion of the signal depicted in Figure 2 and an adaptive weight vector xa that alters the weights of sidelobes. Finally, the signals from the upper portion and lower portion are subtracted from each other, resulting in the further reduction of sidelobes.The output of GSC after passing vectorb is given by [32, 33](12)Z=xHb,where xH=xqH-xaHCaH and its dimension is 1×W.The weight vectorxH=xqH-xaHCaH that minimizes the output power of (12) with multiple linear constraints using LCMV is given by(13)minxxHRx,s.t.xHC=fH.Its solution is given by(14)xoH=fHCHRC-1CHR-1,where(15)R=EbbH=σb2…0⋮⋱⋮0…σb2represents the correlation matrix having dimension W×W, σb2 represents the variance, and C represents the W×Ns constraint matrix, having Ns steering vectors given by (16)C=s1,s2,…,sNs,where Ns represents the frequency number in the defined portion of the signal shown in Figure 2. sj=s1,s2,…,sWT is a jth steering vector having dimension W×1, which contains W samples of the jth spectrum, while f=1,1,…,1T representing the gain vector having dimension Ns×1 contains gain associated with each steering vector.The useful implementation of LCMV is the division ofW-dimensional space into constraint subspace defined by columns ofC and orthogonal subspace defined by columns of Ca. Thus,(17)CHCa=O,where O is the null matrix having dimension N×(W-Ns) and Ca is the blocking matrix having dimension W×(W-Ns).Now, consider the partition ofxoH into two orthogonal components(18)xoH=xcH-xPH,where xcH is the projection of xoH onto the constraint subspace and xPH is the projection of xoH onto the orthogonal subspace. The projection matrices onto the constraint and orthogonal subspace both having dimension W×W are given by(19)Pc=CCHC-1CH,(20)Po=CaCaHCa-1CaH.So, therefore,(21)xcH=xoHPc,(22)xPH=xoHPo.On putting (14) and (19) into (21), we get(23)xcH=fHCHC-1CH≜xqHdefined as the quiescent weight vector with dimension 1×W. Also, putting (14) and (20) into (22) gives(24)xPH=fHCHR-1C-1CHR-1CaCaHCa-1CaH.Equation (24) is correct but is not particularly useful, so it is suggested to be divided into two portions. The first portion contains Ca, the blocking matrix, while the second portion contains xa, the adaptive weight vector having dimension W-Ns×1. For obtaining the blocking matrix Ca, we will first find Po using(25)Po=I-Pcand orthonormalizing Po and then taking the first W-Ns columns of the orthonormalized matrix, resulting in the blocking matrix Ca with the following property:(26)CaHCa=I.For adaptive weight vector xa substituting xH=xqH-xaHCaH in (12),(27)Z=xqH-xaHCaHb.The power output is(28)P=xqH-xqHCqHRxq-Caxa.Taking gradient of (28) with respect to xa and setting the results equals to zero, we get an optimum adaptive weight vector x^aH given by(29)x^aH=xqHRCaCaHRCa-1.


## 4. Simulation Results

In this section, we consider five different spectrum sharing scenarios to check the efficiency and authenticity of our proposed techniques. We compare the performance of our proposed techniques with the current techniques with the help of computer simulations in terms of normalized power spectral density (PSD). As discussed above, DE is simple and straightforward to implement and has much better performance in terms of accuracy, convergence speed, computational complexity, and robustness as compared to the other EAs like GA and others. Therefore, the performance of proposed technique II is better as compared to the performance of proposed technique I in all five different spectrum sharing scenarios.


### 4.1. Scenario I

In this scenario, assume that CR detects a single vacant band divided into 16 OFDM subcarriers mapped with BPSK and is utilized by a single SU. The efficiency of our proposed techniques for this scenario is compared with the current techniques, including CC [7, 8], ACC [11], ASW [12], CC using GA and DE [9], and GSC [32], as shown in Figures 4 and 5. In all simulated results, a total of four CCs are considered. From Figures 4 and 5, it is observed that the proposed techniques give better suppression of sidelobes as compared with other techniques.Figure 4
The PSD performance comparison between the proposed techniques and existing techniques, Scenario I.Figure 5
The PSD performance comparison between the proposed techniques and existing techniques, Scenario I.


### 4.2. Scenario II

In this scenario, assume that CR detects four vacant bands, denoted by II, IV, VI, and VIII, all having equal bandwidths. The spacing between these bands denoted by I, III, V, VII, and IX is also considered as of equal bandwidths. SUs functioning in bands II, IV, VI, and VIII use 32 OFDM subcarriers, mapped with BPSK. The performances of the proposed techniques in terms of PSD with others, including ASW [12], ACC [11], CC [7, 8], CC using GA and DE [9], and GSC [32], are shown in Figures 6 and 7. Two CCs on either side of the original spectrum are inserted in all the CC based suppression techniques. Figures 6 and 7 show that the proposed technique got a reduction considerably, as compared with other existing techniques.Figure 6
The PSD performance comparison between the proposed techniques and existing techniques, Scenario II.Figure 7
The PSD performance comparison between the proposed techniques and existing techniques, Scenario II.


### 4.3. Scenario III

In this scenario, consider the notion that white holes detected by CR are given by II, IV, VI, and VIII, which have the same bandwidth. The spacing between white holes is given by I, III, V, VII, and IX, respectively, which have different bandwidths. An equal number of OFDM subcarriers (i.e., 32) are used by the SUs operating in these white holes, mapped with BPSK. The reliability and effectiveness of the proposed techniques are shown in Figures8 and 9 that show the comparison in terms of PSD with current techniques, including CC using GA and DE [9], ASW [12], ACC [11], CC [7, 8], and GSC [32]. The proposed techniques get better suppression in that spectrum sharing scenario and outclass all the existing techniques.Figure 8
The PSD performance comparison between the proposed techniques and existing techniques, Scenario III.Figure 9
The PSD performance comparison between the proposed techniques and existing techniques, Scenario III.


### 4.4. Scenario IV

In this scenario, the bandwidth of the spectral white holes detected by CR is considered as unequal represented as II, IV, VI, and VIII. The spacing between them is considered as equal. SUs operating in white hole II use 16 subcarriers, in IV use 32, in VI use 64, and in VIII use 128, each modulated with BPSK. Figures10 and 11 show that the proposed techniques are effective and reliable in such a spectrum sharing scenario and get significant reduction of sidelobes in comparison with the current techniques including CC using GA and DE [9], ASW [12], ACC [11], CC [7, 8], and GSC [32].Figure 10
The PSD performance comparison between the proposed techniques and existing techniques, Scenario IV.Figure 11
The PSD performance comparison between the proposed techniques and existing techniques, Scenario IV.


### 4.5. Scenario V

In this scenario, four spectral white spaces are considered to be detected by CR, represented by II, IV, VI, and VIII, which have unequal bandwidth. Spacing between them is also considered to be unequal. SUs operating in these spectral white spaces use 16 subcarriers in II, 32 in IV, 64 in VI, and 128 in VIII, modulated with BPSK. The performances of our proposed techniques for that scenario compared with the current techniques including CC [7, 8], CC using GA and DE [9], ACC [11], ASW [12], and GSC [32] are given in Figures 12 and 13, which shows that the proposed scheme outclasses all the existing techniques and gets significant reduction.Figure 12
The PSD performance comparison between the proposed techniques and existing techniques, Scenario V.Figure 13
The PSD performance comparison between the proposed techniques and existing techniques, Scenario V.


## 4.1. Scenario I

In this scenario, assume that CR detects a single vacant band divided into 16 OFDM subcarriers mapped with BPSK and is utilized by a single SU. The efficiency of our proposed techniques for this scenario is compared with the current techniques, including CC [7, 8], ACC [11], ASW [12], CC using GA and DE [9], and GSC [32], as shown in Figures 4 and 5. In all simulated results, a total of four CCs are considered. From Figures 4 and 5, it is observed that the proposed techniques give better suppression of sidelobes as compared with other techniques.Figure 4
The PSD performance comparison between the proposed techniques and existing techniques, Scenario I.Figure 5
The PSD performance comparison between the proposed techniques and existing techniques, Scenario I.


## 4.2. Scenario II

In this scenario, assume that CR detects four vacant bands, denoted by II, IV, VI, and VIII, all having equal bandwidths. The spacing between these bands denoted by I, III, V, VII, and IX is also considered as of equal bandwidths. SUs functioning in bands II, IV, VI, and VIII use 32 OFDM subcarriers, mapped with BPSK. The performances of the proposed techniques in terms of PSD with others, including ASW [12], ACC [11], CC [7, 8], CC using GA and DE [9], and GSC [32], are shown in Figures 6 and 7. Two CCs on either side of the original spectrum are inserted in all the CC based suppression techniques. Figures 6 and 7 show that the proposed technique got a reduction considerably, as compared with other existing techniques.Figure 6
The PSD performance comparison between the proposed techniques and existing techniques, Scenario II.Figure 7
The PSD performance comparison between the proposed techniques and existing techniques, Scenario II.


## 4.3. Scenario III

In this scenario, consider the notion that white holes detected by CR are given by II, IV, VI, and VIII, which have the same bandwidth. The spacing between white holes is given by I, III, V, VII, and IX, respectively, which have different bandwidths. An equal number of OFDM subcarriers (i.e., 32) are used by the SUs operating in these white holes, mapped with BPSK. The reliability and effectiveness of the proposed techniques are shown in Figures8 and 9 that show the comparison in terms of PSD with current techniques, including CC using GA and DE [9], ASW [12], ACC [11], CC [7, 8], and GSC [32]. The proposed techniques get better suppression in that spectrum sharing scenario and outclass all the existing techniques.Figure 8
The PSD performance comparison between the proposed techniques and existing techniques, Scenario III.Figure 9
The PSD performance comparison between the proposed techniques and existing techniques, Scenario III.


## 4.4. Scenario IV

In this scenario, the bandwidth of the spectral white holes detected by CR is considered as unequal represented as II, IV, VI, and VIII. The spacing between them is considered as equal. SUs operating in white hole II use 16 subcarriers, in IV use 32, in VI use 64, and in VIII use 128, each modulated with BPSK. Figures10 and 11 show that the proposed techniques are effective and reliable in such a spectrum sharing scenario and get significant reduction of sidelobes in comparison with the current techniques including CC using GA and DE [9], ASW [12], ACC [11], CC [7, 8], and GSC [32].Figure 10
The PSD performance comparison between the proposed techniques and existing techniques, Scenario IV.Figure 11
The PSD performance comparison between the proposed techniques and existing techniques, Scenario IV.


## 4.5. Scenario V

In this scenario, four spectral white spaces are considered to be detected by CR, represented by II, IV, VI, and VIII, which have unequal bandwidth. Spacing between them is also considered to be unequal. SUs operating in these spectral white spaces use 16 subcarriers in II, 32 in IV, 64 in VI, and 128 in VIII, modulated with BPSK. The performances of our proposed techniques for that scenario compared with the current techniques including CC [7, 8], CC using GA and DE [9], ACC [11], ASW [12], and GSC [32] are given in Figures 12 and 13, which shows that the proposed scheme outclasses all the existing techniques and gets significant reduction.Figure 12
The PSD performance comparison between the proposed techniques and existing techniques, Scenario V.Figure 13
The PSD performance comparison between the proposed techniques and existing techniques, Scenario V.


## 5. Conclusion

In this paper, the OOBR problem, one of the major issues in CR based OFDM, is discussed. To handle that problem, we propose two new techniques: the first one is the combination of CCs using GA with GSC and the second one is the combination of CCs using DE with GSC. The purpose of combining different techniques is to take advantage of the individual techniques for a better reduction of OOBR. The strength and reliability of the proposed techniques are shown via computer simulations in different types of spectrum sharing scenarios, which shows that the proposed techniques get far better reduction of OOBR as compared to the existing techniques and the overall performance of the proposed technique is better.



---

*Source: 1860134-2017-01-16.xml*