# Interference Alignment and Fairness Algorithms for MIMO Cognitive Radio Systems

Authors: Feng Zhao; Wen Wang; Hongbin Chen
Journal: Mobile Information Systems
 (2015)

---

## Abstract

Interference alignment (IA) is an effective technique to eliminate the interference among wireless nodes. In a multiinput multi-output (MIMO) cognitive radio system, multiple secondary users can coexist with the primary user without generating any interference by using the IA technology. However, few works have considered the fairness of secondary users. In this paper, not only is the interference eliminated by IA, but also the fairness of secondary users is considered by two kinds of algorithms. Without losing generality, one primary user andK secondary users are considered in the network. Assuming perfect channel knowledge at the primary user, the interference from secondary users to the primary user is aligned into the unused spatial dimension which is obtained by water-filling among primary user. Also, the interference between secondary users can be eliminated by a modified maximum signal-to-interference-plus-noise algorithm using channel reciprocity. In addition, two kinds of fairness algorithms, max-min fairness and proportional fairness, among secondary users are proposed. Simulation results show the effectiveness of the proposed algorithms in terms of suppressed interference and fairness of secondary nodes. What is more, the performances of the two fairness algorithms are compared.


---

## Body

## 1. Introduction

With the rapid deployment of various wireless systems, the limited radio spectrum is becoming increasingly crowded. What is worse is that it is evident that most of the allocated spectrum experiences low utilization. Cognitive radio has been recently proposed as a potential solution for efficient utilization of the scarce radio resources [1]. The key feature of the cognitive radio is to allow a class of radio devices, called secondary users, to opportunistically access a licensed spectrum that is left unused by the primary user as long as the secondary users will not affect the operation of the primary user adversely. This improves the spectral efficiency greatly for allowing more users to coexist in the same frequency band. Due to the significantly increased channel capacity in MIMO systems, it has become a dominating technique in next generation wireless systems. It is thus quite natural to combine the MIMO and the cognitive radio techniques to achieve higher spectral efficiency. This technological combination results in the so-called cognitive MIMO radio [2].Interference alignment (IA), a recently emerging idea for wireless networks, is an effective approach to manage interference. IA is a technique of signal construction that the interference casts overlapping shadows at the unintended receivers, while the desired signals can still be distinguished at the intended receivers free of interference [3]. Hence, a suitable precoding matrix can be found by which all the interference can be constrained into one-half of the signal spaces at each receiver, leaving the other half not interfering with the desired signal; then, the expected signal can be obtained using the simple zero-forcing method. The concept of IA has been introduced independently in [4–6]. What is more, the idea of IA for the K-user interference channel has been introduced by Gomadam et al. in [6]. They have showed the degrees of freedom (DoF); that is, the interference-free signaling dimensions of this channel are much more than previously thought. For the sake of achieving IA, two kinds of iterative distributed algorithms, that is, minimum weighted leakage interference (MWLI) and maximum signal-to-interference-plus-noise (MSINR), were presented in [7] by exploiting the channel reciprocity. In [8], the authors have analyzed these two kinds of algorithms and compared the bit error rate performance of them. In cognitive MIMO radio systems, interference alignment is a new research direction in recent years. In [9], the interference alignment techniques in cognitive radio systems were introduced for the first time. This study is under cognitive MIMO interference network equipped with one primary user and one secondary user who have the same antennas in the transmitting and receiving nodes. Opportunistic interference alignment (OIA), a technique proposed to allow a single secondary user to exploit the unused spatial directions by the primary user, has received great attention recently. In [10], OIA for one primary user and multisecondary user network was proposed. The relation between the DoF and the number of antennas in cognitive radio systems was studied by author in [11]. Moreover, an imposed minimum weighted leakage interference (MWLI) algorithm in cognitive radio networks with multiprimary user and multisecondary user was proposed in [12].In cognitive MIMO networks, some of works tried to maximize the throughput of users under the premise of sacrificing the fairness which uses some algorithms like [13]. In [13], game theory is introduced to maximize the throughput of users. The researches above did not consider the fairness of secondary users. However, fairness is an essential problem in cognitive MIMO systems. In recent years, two kinds of fairness are taken into consideration when the researchers study the throughput of users. On one hand, max-min fairness is a hotpot problem. The authors in [14, 15] have considered the max-min signal-to-interference-plus-noise ratio (SINR) for a MIMO downlink system. In [16], the max-min fairness has been considered in a multipair two-way relay system. In [17, 18], the authors have achieved fairness by allocating the resource in MIMO networks. In cognitive radio networks, the max-min fairness has also been considered in [19]. On the other hand, the proportional fairness was also studied by many authors. Max-min fairness aimed to maximize the fairness while proportional fairness was considered to achieve tradeoff between system throughput and fairness [20]. In [20, 21], proportional fairness has been considered in OFDM systems. In [22], the authors have proposed a Quality of Experience- (QoE-) based proportional fair scheduling considering network-wide users’ QoE maximization as well as fairness among users in the multicell OFDMA networks. Also, in [23], proportional fairness has been studied in virtual MIMO networks which have combined the advantages of proportional fairness and maximum rate rules. Moreover, proportional fairness has been studied in wireless mesh networks in [24] which derived the joint allocation of flow airtimes and coding rates that achieves the proportionally fair throughput allocation. In [25], the resource allocation problem with the proportional fair constraint condition based on quantised feedback for multiuser orthogonal frequency division multiplexing access system has been proposed. Besides, the proportional fair scheduling has been studied under imperfect channel state information (CSI) in [26]. However, few works have thought about the IA and fairness together. Next, we will solve this fairness problem in a cognitive MIMO network.In this paper, we consider the case of multiple secondary users opportunistically exploiting the same frequency band utilized by a primary user. IA-based cognitive transmission schemes are developed that secondary users can exploit the unused spatial dimensions left by the primary user so that no interference is generated at the primary receiver. What is more, no interference from the primary transmitter or other secondary transmitters is generated to each of the secondary receiver [9]. IA is performed by us for the secondary links by a modified version of MSINR to find the precoders and reception filters [13]. After the interference alignment, we consider the max-min fairness and proportional fairness among secondary users. The rest of the paper is organized as follows. In Section 2, the system model and the IA problem for the primary user are introduced. In Section 3, we present an iterative distributed IA algorithm. Section 4 presents the fairness for secondary users in the case of a K-user symmetric secondary system. Simulation results are presented in Section 5, and the paper is concluded in Section 6 finally.Notation. We use lower-case bold symbols for vectors and upper-case bold font to denote matrices. In represents the n×n identity matrix and the m×n null matrix is represented by 0m×n. trA, rankA, spanA, NA, A, and AH denote the trace, rank, range, nullspace, norm, and Hermitian transpose of the matrix, respectively, and A∗i denotes the ith column of the matrix. Besides, E· denotes the statistical expectation and p+=max0,p.


## 2. System Model

As shown in Figure1, a (K+1)-user MIMO interference channel in a CR MIMO network is considered by us. Assume that the secondary users share the same spectrum with the primary user. The primary user is denoted by index 0 while the secondary users are denoted by index 1,…,K. The symbols Mi and Ni denote the number of antennas at the ith transmitter and receiver, respectively. We assume that the ith user sends di independent streams meaning the DoF are di. And xi=xi1,…,xidiT denotes the transmit signal of ith user, and the power matrix of the ith user is denoted by Pi=ExixiH=diag(pi1,…,pidi). Let Vi denote the Mi×di precoding matrix of the ith user. So, the received signal at the ith receiver of dimension Ni can be written as [11](1)yi=∑j=0KHijVjPjxj+zi,i=1,2,…,K,where Hij is the Ni×Mj matrix that represents the channel gain between the transmitter j and the receiver i. The channels are assumed to experience block fading and the elements of the channels are constant.Figure 1
MIMO cognitive radio system.It must be noted that the entries of all channel matrices are drawn from a continuous distribution independently. Accordingly, all channel matrices are surely full rank [12]. zi (Ni×1) denotes the additive white Gaussian noise vector with zero mean, whose covariance matrix is denoted by σi2INi. The received signal at the ith receiver is postprocessed by the Ni×di postprocessing matrix Ui to extract the di transmitted symbols. Therefore, the postprocessed output of the ith receiver is given by UiHyi [11].Also, we assume that the primary transmitter is oblivious to the presence of the secondary users. And the primary channel matrixH00 is known at the primary transmitter and receiver. By choosing the precoding matrix V0 in the transmitter side and selecting the postprocessing matrix U0 in the receiver side, the primary link channel can be transferred into a diagonal matrix. The singular value decomposition of the matrix H00 is given by H00=U¯0HΛ0V¯0, where Λ0 is N0×M0 diagonal matrix whose diagonal elements are the minM0,N0 nonzero singular values of the matrix H00. The columns of the precoding matrix V0 and the postprocessing matrix U0 correspond to a nonzero power allocation [11]. Then, the achievable rate of the primary user is maximized by the power allocation matrix P0 which is the solution to the following optimization problem [9]:(2)max⁡P0log2⁡IN0+1σ2H00V¯0P0V¯0HH00Hs.t.tr⁡⁡P0≤pmax⁡,P0≥0.The solution to (2) is the well-known water-filling algorithm. According to this method, the optimal power allocation matrix is a diagonal matrix with entries [9]:(3)p0i=β0-σ2λ0i2+,i=1,…,M0,where the constant β0 is the Lagrangian multiplier that is determined to satisfy the power constraint in (2).Noting the received signal at theith receiver due to the jth transmitter lies in the subspace spanned by the columns of HijVj. For the purpose of ensuring that the secondary transmitters do not generate any interference to the primary receiver and the secondary users are orthogonal to the received signal from the primary link, we have the following conditions [11]:(4)U0HH0jVj=0d0×dj,∀j=1,…,K,UiHHi0V0=0di×d0,∀i=1,…,K.The feasibility of the cognitive interference alignment problem in (4) was proved in [11].It is obvious that the interference between the primary link and the secondary links can affect the performance of cognitive MIMO systems adversely. Now, this interference is eliminated by (4). Thus, an iterative IA algorithm can be performed to eliminate the interference between secondary users in Section 3 and achieve the fairness of secondary users in Section 5 without considering the interference above.


## 3. IA Scheme for the Secondary Link

In this section, aK-user secondary system with constant channel coefficients is considered by us. We will start by providing an achievable scheme for the above system and then present an iterative IA algorithm for the system where channel reciprocity holds.


### 3.1. Achievability of IA for Symmetric MIMO Cognitive System

In order to achieve IA, the following constraint must be satisfied on the precoding and postprocessing matrices of the secondary system [6]:(5)UiHHijVj=0di×dj,∀j≠i,(6)rank⁡UiHHiiVi=di,∀i=1,…,K.The constraint in (5) ensures that no interference is generated from other undesired secondary transmitters. Moreover, the constraint in (6) guarantees that the dimension of the desired signal space at the ith receiver is di.Using the idea of decomposition in [11], we define the Mi-d0×di matrices V~ii=1K and the Ni-d0×di matrices U~ii=1K such that [11](7)Vi=GiV~i,∀i=1,…,K,Ui=BiU~i,∀i=1,…,K,where Gi (Mi×Mi-d0) and Bi (Ni×Ni-d0) span the nullspace of the matrices U0HH0j and Hi0V0, respectively.Using the decomposition in (7), we can convert (5) and (6) into the following equations [11]:(8)U~iHBiHHijGjV~j=0di×dj,∀i≠j,rank⁡U~iHBiHHiiGiV~i=di,∀i=1,…,K.The modified problem in (8) is a standard IA problem in the variables V~ii=1K and U~ii=1K [11].


### 3.2. Iterative IA Algorithm

In this subsection, we propose a modified version of the iterative MSINR algorithm in [7] for IA of the secondary users in the presence of the primary user whose interference is aligned with such a similar algorithm. A reciprocal channel in which the roles of the transmitters and receivers are switched is defined by us. The reciprocal channel between the transmitter j and the receiver i in the reciprocal network is denoted by H←ij and H←ij=HjiH due to the channel reciprocity. It is shown in [6] that if the DoF allocation dii=1K is feasible on the original system, it is also feasible on the reciprocal system (and vice versa).Note that, by listening to the primary transmitter and estimating the subspaces spanned byHi0V0, the ith secondary receiver can estimate Bi. Similarly, by listening to the transmission from the primary receiver and estimating the subspace spanned by H←j0U0, the jth secondary transmitter can estimate Gj [11]. Therefore, the distributed IA algorithm in [7] can be used to estimate the jth modified precoding matrix V~j and the ith postprocessing matrix U~i by secondary transmitters and receivers, respectively. We must note that, in this algorithm, the secondary users do not need the whole channel state information, and local channel state information is sufficient for the secondary users [13].Algorithm 1 (Max-SINR Algorithm).
We have the following:(1)
Start with any matrixV~i: Mi-d0×di; the columns of V~i are linearly independent unit vectors.(2)
Iteration is beginning.(3)
Compute interference plus noise covariance matrix for streaml at the receiver i:(9)Cil=∑j=1KPjdj∑d=1djBjHHijGjV~j∗dV~j∗dHGjHHijHBj-PidiBiHHiiGiV~i∗lV~i∗lHGiHHiiHBi+INi∀i∈1,2,…,K,l∈1,2,…,dk.(4)
Compute receiver combining vectors:(10)Ui∗l=Cil-1BiHHiiGiV~i∗lCil-1BiHHiiGiV~i∗l∀i∈1,2,…,K,l∈1,2,…,dk.(5)
Reverse the communication direction and use the receiver combining vectors as precoding vectors:V~←i=U~i, ∀i∈1,2,…,K.(6)
Compute interference plus noise covariance matrix in the reciprocal system:(11)C←il=∑j=1KPjdj∑d=1djGjHH←ijHBjV~←j∗dV~←j∗dHBjHH←ijHGj-PidiGiHH←iiBiV~←i∗lV~←i∗lHBiHH←iiHGi+INi∀i∈1,2,…,K,l∈1,2,…,dk.(7)
Calculate the receiver combining vectors in the reciprocal system:(12)U←i∗l=C←il-1GiHH←iiBiV~←i∗lC←il-1GiHH←iiBiV~←i∗l.(8)
Reverse the communication direction and use the receiver combining vectors as precoding vectors:V~i=U~←i, ∀k∈1,…,K.(9)
Repeat until convergence or the number of iterations reaches a limit defined earlier.


## 3.1. Achievability of IA for Symmetric MIMO Cognitive System

In order to achieve IA, the following constraint must be satisfied on the precoding and postprocessing matrices of the secondary system [6]:(5)UiHHijVj=0di×dj,∀j≠i,(6)rank⁡UiHHiiVi=di,∀i=1,…,K.The constraint in (5) ensures that no interference is generated from other undesired secondary transmitters. Moreover, the constraint in (6) guarantees that the dimension of the desired signal space at the ith receiver is di.Using the idea of decomposition in [11], we define the Mi-d0×di matrices V~ii=1K and the Ni-d0×di matrices U~ii=1K such that [11](7)Vi=GiV~i,∀i=1,…,K,Ui=BiU~i,∀i=1,…,K,where Gi (Mi×Mi-d0) and Bi (Ni×Ni-d0) span the nullspace of the matrices U0HH0j and Hi0V0, respectively.Using the decomposition in (7), we can convert (5) and (6) into the following equations [11]:(8)U~iHBiHHijGjV~j=0di×dj,∀i≠j,rank⁡U~iHBiHHiiGiV~i=di,∀i=1,…,K.The modified problem in (8) is a standard IA problem in the variables V~ii=1K and U~ii=1K [11].


## 3.2. Iterative IA Algorithm

In this subsection, we propose a modified version of the iterative MSINR algorithm in [7] for IA of the secondary users in the presence of the primary user whose interference is aligned with such a similar algorithm. A reciprocal channel in which the roles of the transmitters and receivers are switched is defined by us. The reciprocal channel between the transmitter j and the receiver i in the reciprocal network is denoted by H←ij and H←ij=HjiH due to the channel reciprocity. It is shown in [6] that if the DoF allocation dii=1K is feasible on the original system, it is also feasible on the reciprocal system (and vice versa).Note that, by listening to the primary transmitter and estimating the subspaces spanned byHi0V0, the ith secondary receiver can estimate Bi. Similarly, by listening to the transmission from the primary receiver and estimating the subspace spanned by H←j0U0, the jth secondary transmitter can estimate Gj [11]. Therefore, the distributed IA algorithm in [7] can be used to estimate the jth modified precoding matrix V~j and the ith postprocessing matrix U~i by secondary transmitters and receivers, respectively. We must note that, in this algorithm, the secondary users do not need the whole channel state information, and local channel state information is sufficient for the secondary users [13].Algorithm 1 (Max-SINR Algorithm).
We have the following:(1)
Start with any matrixV~i: Mi-d0×di; the columns of V~i are linearly independent unit vectors.(2)
Iteration is beginning.(3)
Compute interference plus noise covariance matrix for streaml at the receiver i:(9)Cil=∑j=1KPjdj∑d=1djBjHHijGjV~j∗dV~j∗dHGjHHijHBj-PidiBiHHiiGiV~i∗lV~i∗lHGiHHiiHBi+INi∀i∈1,2,…,K,l∈1,2,…,dk.(4)
Compute receiver combining vectors:(10)Ui∗l=Cil-1BiHHiiGiV~i∗lCil-1BiHHiiGiV~i∗l∀i∈1,2,…,K,l∈1,2,…,dk.(5)
Reverse the communication direction and use the receiver combining vectors as precoding vectors:V~←i=U~i, ∀i∈1,2,…,K.(6)
Compute interference plus noise covariance matrix in the reciprocal system:(11)C←il=∑j=1KPjdj∑d=1djGjHH←ijHBjV~←j∗dV~←j∗dHBjHH←ijHGj-PidiGiHH←iiBiV~←i∗lV~←i∗lHBiHH←iiHGi+INi∀i∈1,2,…,K,l∈1,2,…,dk.(7)
Calculate the receiver combining vectors in the reciprocal system:(12)U←i∗l=C←il-1GiHH←iiBiV~←i∗lC←il-1GiHH←iiBiV~←i∗l.(8)
Reverse the communication direction and use the receiver combining vectors as precoding vectors:V~i=U~←i, ∀k∈1,…,K.(9)
Repeat until convergence or the number of iterations reaches a limit defined earlier.


## 4. Fairness for the Secondary Users

After the dispose in Section3, the received signal at the ith secondary user can be denoted by(13)yi=∑j=1KUiHHijVjPjxj+UiHHi0V0P0x0+UiHn,where n denotes the additive noise matrix and is assumed to be complex Gaussian, with zero mean and variance σ2. Then, the signal-to-interference-plus-noise ratio (SINR) of the ith secondary user is(14)SINRi=UiHHiiViPi∑j=1,j≠iKUiHHijVjPj+UiHHi0V0P0+σ2,where UiHHi0V0P0 denotes the interference from the ith secondary user to the primary user, UiHHiiViPi denotes the desired signal, and ∑j=1,j≠iKUiHHijVjPj denotes the interference from other secondary users. Also, the utility of users can be denoted as(15)ui=log2⁡1+SINRi.


### 4.1. Max-Min Fairness

In this subsection, we will realize the fairness by maximizing the minimum SINR of secondary users. In cognitive MIMO systems, the secondary users share the same spectrum with the primary user and achieve the best throughput. Therefore, we should investigate appropriate power weights to distribute them among the users so that the minimum throughput of secondary users is maximized. From (15), we know that we can try to maximize the minimum SINR instead of the throughput in order to simplify this problem. Actually, maximizing the minimum SINR amounts to equalizing the SINR performance of all users [14]. Thus, the optimization problem can be formally stated as follows:(16)max⁡P1,P2,…,PKmin⁡i=1,…,KSINRis.t.∑i=1KPi≤pTI0≤Ith0≤Pi≤pT,where pT and Ith are the given values with respect to the total transmit power and interference threshold, respectively. Our objective is to consider the optimization of power allocation in order to maximize the minimum SINR of the secondary system with the following three constraints. The first constraint restricts the total transmission power from the secondary transmitters. The second constraint is to guarantee the interference power to the primary receiver is bounded by a certain limit. In the third constraint, each power is limited in secondary users.By introducing a new variablet, which is t=mini=1,…,K⁡SINRi, we can rewrite this optimization problem in (16) as follows:(17)min⁡P1,P2,…,PK1ts.t.∑i=1KPi≤pTI0≤Ith0≤Pi≤pT.


#### 4.1.1. Max-Min Algorithm

In this subsection, a kind of intelligent algorithm, called particle swarm optimization (PSO), is presented to allocate the power to maximize the minimum SINR. The particle swarm optimization (PSO) algorithm is a kind of evolutionary computation, which is derived from the study on the behavior of the birds swarm and is similar to the genetic algorithm, and is a kind of iterative optimization tool.The algorithm is summarized as follows.Algorithm 2 (Max-Min SINR Algorithm).
We have the following:(1)
Initialize particle positionvi0; speed is denoted by power allocation matrix Pi0, i∈Ω.(2)
Compute the value ofSINRi, i=1,…,K, (18)SINRi=UiHHiiViPi∑j=1,j≠iKUiHHijVjPj+UiHHi0V0P0+σ2for i=1,…,K, calculate, compare, and find the minimum SINR which is indicated by t.(3)
Compute the fitness function:(19)fitness=minP1,P2,…,PK⁡1t.(4)
Compute the optimal solutions of population and individual, denoted by gbest and pbest, respectively:
If pbest = gbest, output the optimal result.Or else, update the particle positionvi and power allocation matrix Pi; then, update the fitness function by Steps (2) and (3).(5)
Repeat Steps (2), (3), and (4) until convergence.In the algorithm above, our goal is to minimize the fitness function of PSO by changing the norm of power matrix. When the power is updated, the value ofSINRi, i=1,…,K, will be changed afterwards; then, we should reorder the value of SINRi, i=1,…,K. Therefore, the fitness function will be updated too.


### 4.2. Proportional Fairness

In order to obtain a balance between maximizing the system throughput and maintaining user fairness, proportional fairness was proposed in [23]. In this subsection, we let Tin denote the average throughput of user i at nth time slot and Rin denotes the estimated supportable data rate of user i at the nth time slot. The user to be scheduled at the nth time slot is [23](20)i=arg⁡max⁡RinTin,1≤i≤K.Then, Tin is updated using [27]:(21)Tin+1=1-1tcTin+1tcRin,i=i∗1-1tcTin,i≠i∗,where tc is a constant parameter which determines the effective memory of the throughput averaging window [23].The algorithm is summarized as follows.Algorithm 3 (Proportional Fairness Algorithm).
We have the following:(1)
Initialize power allocation matrixPi0, i∈Ω:
Fori=1:K,
Compute the throughput of useri by (10) and (11): (22)ui=log2⁡1+SINRi.End.(2)
Computei by (14):(23)i=arg⁡max⁡RinTin,1≤i≤K.Update Tin according to (15).(3)
Update the power allocation matrix, and repeat Steps (1) and (2) until reaching the maximum number of iterations.Max-Min and PF algorithms are two effective and common algorithms to study the fairness problem. In our network, we want to show their effectiveness and compare these two algorithms in different aspects in the simulation results.


## 4.1. Max-Min Fairness

In this subsection, we will realize the fairness by maximizing the minimum SINR of secondary users. In cognitive MIMO systems, the secondary users share the same spectrum with the primary user and achieve the best throughput. Therefore, we should investigate appropriate power weights to distribute them among the users so that the minimum throughput of secondary users is maximized. From (15), we know that we can try to maximize the minimum SINR instead of the throughput in order to simplify this problem. Actually, maximizing the minimum SINR amounts to equalizing the SINR performance of all users [14]. Thus, the optimization problem can be formally stated as follows:(16)max⁡P1,P2,…,PKmin⁡i=1,…,KSINRis.t.∑i=1KPi≤pTI0≤Ith0≤Pi≤pT,where pT and Ith are the given values with respect to the total transmit power and interference threshold, respectively. Our objective is to consider the optimization of power allocation in order to maximize the minimum SINR of the secondary system with the following three constraints. The first constraint restricts the total transmission power from the secondary transmitters. The second constraint is to guarantee the interference power to the primary receiver is bounded by a certain limit. In the third constraint, each power is limited in secondary users.By introducing a new variablet, which is t=mini=1,…,K⁡SINRi, we can rewrite this optimization problem in (16) as follows:(17)min⁡P1,P2,…,PK1ts.t.∑i=1KPi≤pTI0≤Ith0≤Pi≤pT.


### 4.1.1. Max-Min Algorithm

In this subsection, a kind of intelligent algorithm, called particle swarm optimization (PSO), is presented to allocate the power to maximize the minimum SINR. The particle swarm optimization (PSO) algorithm is a kind of evolutionary computation, which is derived from the study on the behavior of the birds swarm and is similar to the genetic algorithm, and is a kind of iterative optimization tool.The algorithm is summarized as follows.Algorithm 2 (Max-Min SINR Algorithm).
We have the following:(1)
Initialize particle positionvi0; speed is denoted by power allocation matrix Pi0, i∈Ω.(2)
Compute the value ofSINRi, i=1,…,K, (18)SINRi=UiHHiiViPi∑j=1,j≠iKUiHHijVjPj+UiHHi0V0P0+σ2for i=1,…,K, calculate, compare, and find the minimum SINR which is indicated by t.(3)
Compute the fitness function:(19)fitness=minP1,P2,…,PK⁡1t.(4)
Compute the optimal solutions of population and individual, denoted by gbest and pbest, respectively:
If pbest = gbest, output the optimal result.Or else, update the particle positionvi and power allocation matrix Pi; then, update the fitness function by Steps (2) and (3).(5)
Repeat Steps (2), (3), and (4) until convergence.In the algorithm above, our goal is to minimize the fitness function of PSO by changing the norm of power matrix. When the power is updated, the value ofSINRi, i=1,…,K, will be changed afterwards; then, we should reorder the value of SINRi, i=1,…,K. Therefore, the fitness function will be updated too.


## 4.1.1. Max-Min Algorithm

In this subsection, a kind of intelligent algorithm, called particle swarm optimization (PSO), is presented to allocate the power to maximize the minimum SINR. The particle swarm optimization (PSO) algorithm is a kind of evolutionary computation, which is derived from the study on the behavior of the birds swarm and is similar to the genetic algorithm, and is a kind of iterative optimization tool.The algorithm is summarized as follows.Algorithm 2 (Max-Min SINR Algorithm).
We have the following:(1)
Initialize particle positionvi0; speed is denoted by power allocation matrix Pi0, i∈Ω.(2)
Compute the value ofSINRi, i=1,…,K, (18)SINRi=UiHHiiViPi∑j=1,j≠iKUiHHijVjPj+UiHHi0V0P0+σ2for i=1,…,K, calculate, compare, and find the minimum SINR which is indicated by t.(3)
Compute the fitness function:(19)fitness=minP1,P2,…,PK⁡1t.(4)
Compute the optimal solutions of population and individual, denoted by gbest and pbest, respectively:
If pbest = gbest, output the optimal result.Or else, update the particle positionvi and power allocation matrix Pi; then, update the fitness function by Steps (2) and (3).(5)
Repeat Steps (2), (3), and (4) until convergence.In the algorithm above, our goal is to minimize the fitness function of PSO by changing the norm of power matrix. When the power is updated, the value ofSINRi, i=1,…,K, will be changed afterwards; then, we should reorder the value of SINRi, i=1,…,K. Therefore, the fitness function will be updated too.


## 4.2. Proportional Fairness

In order to obtain a balance between maximizing the system throughput and maintaining user fairness, proportional fairness was proposed in [23]. In this subsection, we let Tin denote the average throughput of user i at nth time slot and Rin denotes the estimated supportable data rate of user i at the nth time slot. The user to be scheduled at the nth time slot is [23](20)i=arg⁡max⁡RinTin,1≤i≤K.Then, Tin is updated using [27]:(21)Tin+1=1-1tcTin+1tcRin,i=i∗1-1tcTin,i≠i∗,where tc is a constant parameter which determines the effective memory of the throughput averaging window [23].The algorithm is summarized as follows.Algorithm 3 (Proportional Fairness Algorithm).
We have the following:(1)
Initialize power allocation matrixPi0, i∈Ω:
Fori=1:K,
Compute the throughput of useri by (10) and (11): (22)ui=log2⁡1+SINRi.End.(2)
Computei by (14):(23)i=arg⁡max⁡RinTin,1≤i≤K.Update Tin according to (15).(3)
Update the power allocation matrix, and repeat Steps (1) and (2) until reaching the maximum number of iterations.Max-Min and PF algorithms are two effective and common algorithms to study the fairness problem. In our network, we want to show their effectiveness and compare these two algorithms in different aspects in the simulation results.


## 5. Simulation Results

In this section, a 3-secondary user and 1-primary user symmetric cognitive MIMO system with constant channel coefficients are simulated. Each node is equipped withMi=Ni=6 antennas. Furthermore, the channel coefficients are selected as zero mean unit-variance circularly symmetric complex Gaussian random variables. On the other hand, the primary transmitter and receiver are also equipped with M0=N0=6 antennas [13]. We select the channel H00 such that only two eigenmodes are active at the primary transmitter; that is, d0=2 [11]. From [11], we get that for a symmetric system in which each secondary transmitter and receiver have M and N antennas, respectively, having the same number of DoF d, the system is proper if M+N-2d0-K+1d≥0; thus, the maximum number of achievable DoF per secondary user is d=2, if d0 is selected to be 2. In the following simulation, we choose noise power σ2=1 W and maximum sum transmit power of secondary users pmax=20 W, the primary user transmit power is p0=20 W for the sake of fairness [13], and the interference threshold is chosen to be 100 [28]. In the PSO, the number of particles is chosen to be 40.Figure2 shows the minimum SINR calculated by max-min algorithm and the throughput computed by PF algorithm among secondary users, respectively. Great advantage of the IA algorithm can be found. From the simulation results above, we know that the result above with IA performed better than that without IA because the interference between secondary users has been eliminated by IA. Besides, the convergence of max-min algorithm is also shown in Figure 2.Figure 2
SINR and throughput comparison with/without IA.In Figure3, we compare the sum throughput of the secondary users with max-min, PF, and game-theoretic algorithm in [13] which maximize the sum utility and ignore the fairness among users. From this curve, we know that the authors in [13] who have not considered the fairness problem get the largest sum throughput. In addition, in the algorithms which have considered the fairness problem, the max-min algorithm achieves the low throughput while the PF algorithm performs better than it in terms of throughput.Figure 3
The sum throughput of SUs with three algorithms.In Figure4, we compute the fairness index by using Jain’s fairness index [29] which is defined as(24)FI=∑i=1Kui2K∑i=1Kui2.As shown in Figure 4, the algorithms which have considered the fairness problem perform better than the algorithm in [13]. In detail, the max-min algorithm has the higher fairness index than the PF algorithm while the game-theoretic algorithm which ignores the fairness has the lowest fairness index. Combined with the results in Figure 3, we know that the PF algorithm achieves the tradeoff of throughput and fairness, and the max-min fairness is better in achieving fairness of secondary users.Figure 4
The fairness index of SUs with three algorithms.


## 6. Conclusion

In this paper, we have presented a cognitive IA scheme, allowing multiple secondary users to access the free spatial dimensions of a primary user, which protects the transmission of the primary user while providing interference-free communication for the secondary users. Also, we presented an iterative algorithm that utilizes channel reciprocity to achieve the proposed cognitive IA scheme forK secondary user MIMO cognitive radio systems. Moreover, we have thought about the fairness among secondary users; thus, two kinds of algorithms are proposed for the cognitive MIMO system which consists of single primary user and multiple secondary users sharing the same spectrum. Finally, from the simulation results, we get that the algorithms with IA are much more effective than those without IA. Besides, the fairness and sum throughput among different algorithms are also compared. To sum up, in this paper, we not only eliminate the interference by IA but also achieve the fairness among secondary users.



---

*Source: 907142-2015-10-04.xml*