Scholarly article on topic 'Sum-rate maximization and robust beamforming design for MIMO two-way relay networks with reciprocal and imperfect CSI'

Sum-rate maximization and robust beamforming design for MIMO two-way relay networks with reciprocal and imperfect CSI Academic research paper on "Electrical engineering, electronic engineering, information engineering"

Share paper

Academic research paper on topic "Sum-rate maximization and robust beamforming design for MIMO two-way relay networks with reciprocal and imperfect CSI"

EURASIPJournal on Wireless Communications and Networking

RESEARCH Open Access

Sum-rate maximization and robust beamforming design for MIMO two-way relay networks with reciprocal and imperfect CSI

Wei Duan1, Miaowen Wen2, Xueqin Jiang3*, Yier Yan4 and Moon Ho Lee1


In this paper, we investigate the robust relay beamforming design for a multi-input multi-output (MIMO) two-way relay networks (TWRN) by considering imperfect and reciprocal channel state informations (CSIs). In order to maximize the sum-rate (SR) subject to the individual relay power constraint, we first equivalently convert the objective problem into a sum of the inverse of the signal-to-residual-interference-plus-noise ratio (SI-SRINR) problem. The SI-SRINR problem can be reformulated as a biconvex semi-definite programming (SDP) which employs bounded channel uncertainties as the worst-case model. Then, we convert residual-interference-plus-noise (RIN) and relay power constraints into linear matrix inequalities (LMIs). By this way, the objective problem can be tackled by the proposed efficient iterative algorithm. The analysis demonstrates the procedures of the proposed SI-SRINR robust design.

Keywords: Two-way relay, Sum-rate, Imperfect CSI, SDP, LMI

1 Introduction

Recently, cooperative multi-input multi-output (MIMO) relaying system approach is popularized to increase the system capacity and improve the transmission reliability by leveraging spatial diversity. The MIMO relay network with perfect channel state information (CSI) has been studied in [1-3]. In [1], the authors developed a unified framework for optimizing two-way linear nonregenerative MIMO relay systems. In [2], the authors studied transceiver designs for a cognitive two-way relay network aiming at maximizing the achievable transmission rate of the secondary user. Based on iterative minimization of weighted mean-square error (MSE), a linear transceiver design algorithm for weighted sum-rate maximization has been investigated in the cellular network [3].

All the above works consider perfect CSI, which, however, is usually hard to obtain in practice, due to inaccurate channel estimation, feedback delay, and so on. To evaluate this imperfectness, by taking account into the channel


3 School of Information Science and Technology, Donghua University, 436 Shanghai, China

Full list of author information is available at the end of the article

uncertainties, the authors proposed a robust multi-branch Tomlinson-Harashima precoding (MB-THP) transceiver design in MIMO relay networks with imperfect CSI [4], where the Kronecker model is adopted for the covari-ance of the CSI mismatch. Moreover, the deterministic CSI uncertainty model has been widely used in the worst-case system [5-8]. In [5], the design of robust relay beamforming for two-way relay networks with channel feedback errors was studied, where each node is equipped with a single antenna. In [6], the authors investigated a robust beamforming scheme for the multi-antenna non-regenerative cognitive relay network with the bounded channel uncertainties which are modeled by the worst-case model. In [7], the authors investigated the multi-antenna non-regenerative relay network and addressed the joint source-relay-destination beamform-ing design problem under deterministic imperfect CSI model. In [8], based on the linear beamformer at the relay and QR successive interference cancelation (SIC) at the destination, the authors proposed a robust minimum MSE-regularized zero-forcing (MMSE-RZF) beamformer optimized in terms of rate. In this work, the authors assumed that the source can estimate the first-hop (form the source to the relay) CSI perfectly via the reciprocal channel when the high signal-to-noise (SNR) is training.

Springer Open

© 2016 The Author(s). Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (, which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a linkto the Creative Commons license, and indicate if changes were made.

In particular, in [9, 10], the authors considered the problem of robust minimum sum mean-square error (SMSE) relay precoder design for the two-way relay networking (TWRN).

For the one-way relay networks [4, 6-8, 10], the self-interference is not considered and the objective problem is easy to be converted into the convex version. For the single-antenna scenarios [5, 11], the equivalent channel can be expressed by employing the Hadamard product. For above references, the objective problem is actually only for the manipulation of a single node. By using ([12] Lemma 2), the robust minimum sum-MSE optimization problem [9, 10] can be easily converted into a convex problem. Therefore, the sum-rate (SR) maximization problem with multi-relay nodes for TWRN with the residual relay power constraint is more challenging and more general. In this paper, we propose a joint source and relay robust beamforming scheme for the MIMO TWRN where both the first- and second-hop CSIs are considered to be reciprocal and imperfectly known at each node. To get the accurate performance, the residual interference has been reserved. Since the considered sum-rate (SR) maximization problem is not only non-convex but also subject to the semi-infinite relay power constraints, we convert the objective problem into a sum of the inverse of the signal-to-residual-interference-plus-noise ratio (SI-SRINR) problem which is subject to the linear matrix inequality (LMIs) version of the constraints. In order to efficiently tackle the SI-SRINR problem, we first transform the problem into a biconvex semi-definite program (SDP) using the sign-definiteness lemma and then propose an alternating iterative algorithm with satisfactory convergence.

Notations: AT and AH denote the transpose and the Hermitian transpose of a matrix A, respectively. IN represents an N x N identity matrix. E(-), <g>, and || • || stand for the statistical expectation, the Kronecker product, and the Frobenius norm.

2 System model and objective problem

A TWRN consisting of two source nodes 1 and 2, Si and S2, and L relay nodes {R1, R2,..., RL} is considered. The source and relay nodes are equipped with M and N antennas, respectively. Each transmission involves two time slots. At the first time slot, after linearly processed by a transceiver beamforming matrix Bt e cMxMb, Vt e {1,2} and Mb < M, with the power constraint as ||Bt||2 < Pt. Denote the data symbol vector transmitted from the source node St as xt e CMbx1 with E {xtxH} = IMb. The received signal at Ri can be expressed as

yRi = Fi,1B1X1 + Fi,2 B2X2 + nRi, (1)

where Fi,t e CNxM, Vi e {1,..., L} represents the channel coefficient from the source node St to the relay node Ri

and nR. ~ CN(0, aR,. IN) denotes the additive white Gaussian noise (AWGN) vector with zero mean and variance

aR in .

At the second time slot, the relay node Ri linearly amplifies yRi with an N x N matrix W; and then broadcasts the amplified signal vector xRi to source nodes 1 and 2. The signal transmitted from relay node R; can be expressed as

XRi = WiyRi. (2)

From (2), the average transmit power consumed by the relay node Ri can be derived as

E { ||XRi II2} = ||WiFi,1B1 ||2+||W;F;,2B2 ||2 + aRl||W;||2 (3)

The received signal at source node St for t e {1,2} can be written as

yt = J2 Gt,iWi( Fit Bt xt + F ;t BjXj) + J2 Gt,;W;nR; + nt, ;=1 ;=1

where Gt,i denotes the channel coefficient form the relay node R; to the source node St of dimension M x N and nt is the noise vector at the source node St with zero mean and variance aS2 IM. By taking into account the estimation error and delay, we further assume that the CSI is partially known at each node and the channels are reciprocal, i.e., F;,t = G^-. To model this imperfect effect, we consider the following additive CSI uncertainties:

F;,t = F;,t + Apy, (4)

where F;,t and AF.t are the nominal values and channel uncertainty of the channel F;,t. For simplicity, we assumed that the channel uncertainties are norm-bounded errors (NBEs) in analogy with [13,14], i.e.,

I AF;,1 I = I AG1,i I = aU I aF;,2 I = I AG2,i | = Ph (5)

where the slack values satisfy 0 < {a;, p;} ^ 1, which is a reasonable assumption in a practical system.

In TWRN, since the signal transmitted by the transceiver nodes reappear as self-interference, by employing the successive interference cancelation (SIC), the self-interference can be completely eliminated with perfect CSI [15]. Nevertheless, considering the imperfect CSI in this paper, the self-interference at both source nodes cannot be completely canceled, and the approximate residual self-interference1 at the source St is

xt = J2 (Gt,;W;F;,tBtXt - Gt,;W;F;,tBt*) i=1 L

(Gt/WAFy + AGt,iWiF;,^ BtXt, (6)

where the term AGt.WiAPцBtxt has been set to be 0 because if we retain this term in xt, it will result

in some terms involving high order of channel uncertainties which is very close to 0 when calculating the covariance of the residual interference. Let xt = Eli (Gt,,W«Ap.t + AgwW«F«,t). The received SRINR at receivers can be thus expressed as



II & Bt II2

EL=i GÎ,«W«|2 + a2

where t = 3 — t for t = {1,2}. The objective of this paper is to maximize the SR, which is subject to the individual

relay transmit power constraint, shown as 2 1

Ti : max V -log2 (1 + SRINRt) Bt ,Wi t=12 2

< PRi, IIBt I2 < Pt,

and H =

Let Nt = aj. |£Gt,«W, |2 Хл=1 Gt,(W,FIjï. The beamforming matrix W, and Bt are optimized by solving the following problem:

T2 : max

Bt ,Wi

Ljlogfl +

I Ht Bt I


t=i \ IxRi I2 < PRi, IIBtI2 < Pt, vt = {1,2}.

-, for t = 1,2, the

Further denoting at = 11 '

II xt Bt I +Nt objective function can be expressed as

max 12log (1 + ai) + 2log (1 + a2)

= max ^log {(1 + a1) x (1 + a2)} = max {a1 + a2 + a1a},

where (a) follows log(-) is a monotonic function and 1 is a constant. Now, we have the equivalent optimization problem as

Q1 : max

Bt ,Wi

a1 + a2 + Я1Я2

s.t. |xRi I2 < PR;, II Bt I2 < Pt.

Since the CSIs are imperfectly known, Q1 cannot be solved by using zero-gradient (ZG) algorithm [16]. In particular, due to a1 and a2 are both not only non-convex but also non-concave, the objective function a1 + a2 + a1a2 is difficult to convert into the convex version. To efficiently solve T2, we propose a biconvex SDP to obtain the suboptimal solution of the worst-case SR.

Proposition 1. The problem T2 is equivalent to T3 with inequality constraints which is given as

T3 : min

Bt Wi.Yt

Y1 + Y2

s.t. qt < Yt, |xr I < PRi, ||Bty2 < Pt,

where qt = ^^| |Nt and Yt is an auxiliary optimization variable which serves as upper bound ofqtfor t = 1,2.

where is the maximum allocated power to the relay and the factor | is due to the half-duplex relay. Obviously, the objective problem T1 is non-convex since the variables Wi and Bt are in the numerator and the denominator of the SRINRt. Moreover, since the semi-infinite expressions of the optimal W., Bt are intractable, it is difficult to obtain the globally optimal solution. In the next section, we will propose a subpotimal solution to solve T1.

3 Joint optimal beamformer design and proposed algorithm

3.1 Joint optimal beamformer design

Proof. The objective problem of the SR can be formulated as follows:

2log ( = i^K



I H2B2


) ■+■ ^l0g ( )(

IIH1B1II2 \ I&2B2I2+N2/

II&2B2 i2+n2/

Since the optimal solution of {max (1 -I- A)(1 + B)} is equivalent to the problem {min (j + B)} [17] and the fact that log(-) is a monotonic function, letting qt =

^xfBt 1 +Nt, the SR maximization problem can be equiv-

yHt Bty

alently converted into {min (q1 + q2)}. Similar to [9], by introducing the auxiliary optimization variable Yt, the problem {min (q1 + q2)} can be recast in the epigraph form [18] as {min (y1 + Y2)}, s.t. qt < Yt2, and we have the objective problem T3. □

The problem T3 is still non-convex with respect to the constraint qt. In order to solve this problem, qt < Yt can be converted into following three convex subproblems which are:

(1) : Nt < çt, (2) : II&Bt I2 < Tt, (3) : IHF Bt I2 > Y- (çt + Tt ),

where gt and Tt are slack values which serve as upper bounds of Nt and ||xtBt |2, respectively. Now, the problem T3 is equivalent to a convex SDP with inequality constraints as:

T4 : min Bt ,Wi,n

Y1 + Y2

s.t. Nt < çt, |xRi I < Prî, II&tBtI2 < Tt,

|H?BtI2 > - (Çt + Tt), IIBtI2 < Pt. Yt

Proposition 2. The constraint Nt < çt can be equiv-alently converted into the linear matrix inequality (LMI)

version as

Г1 - El=i viqHqi sit^

-Qltttf '

vi Imn

h 0,(11)

where дц = ai and д,,2 = в,, vi > 0 are slack variables, q1 = [-1,01xmn], = [0mnx1,yH],fori= 1,...,land

г f fH 1

Proof. See Appendix 1.

0мьмх1, MH , and fa =

i = 1,..., l, a; = i = l,..., 2l, and

(Tt + ?t) VH

V lMMb _

After introducing Bt = vec(Bt)vec(Bt)H, W;F;,t = Qt, WiFt = Qt, W;Afw = AQt, and PRi - al. ||W;||2 < Pr;, the individual relay power constraint can be then rewritten as:

E {vec (Qt) Btvec (Qt) + vec (Aq )H Btvec (Aq)H t=1 1

+ 2K {vec (Qt) Bt vec (Aq^}} - Pr, < 0.

Using ||A + B|| < ||A|| + ||B|| and ||AB|| < ||A|| ||B|| for the residual interference covariance, we have

lift Bt II2 =

X] Gt,iWiAfw ^ AGt,,WiFi,^ Bt i=1

^Gt,iWiAFi,t Bt

WiFi',t Bt

^Gt,iWiAFi,t Bt AGt,, WiFi,t Bt i=1

I>t ft,iWi

Letting 4д

EL=1 BtGt,iW'

the SRINR constraint can be further rewritten as

I Ht Bt ||2 =

L L / ч

+ £ Mgwvec (Agu) + £ Mf,tvec i Af, Л

i=1 ' v ' /

V < ^MGt, i=1

> ^ (Tt + ?t ),

Г2 -E2=1 Ф-qHq2 -&,t sH

-%1,t s -^2l,t s2l

ФlIмN 0

Фи Imn _

j = 1,..., 2l. S, =

0MbMх1, MGt,,

Proposition 3. The individual relay power constraints can be converted to the following LMI:

' B1 + À1I vec (QOB1 0

( )H ( )H

B1vec (Q1) ®t B2vec (Q2) 0 vec (Q2) B2 B2 + Ы .

h 0, (16)

where ®t = E2=1 vec(F^)Btvec (Gi/)" - A^a? -Х2«>2в} - P^ with aH = ||Will.

Proof. See Appendix 2.

By putting all these components together, the objective problem T4 becomes

= Tt, similar to Appendix 1,

T5 : min

Bt ,W;,n

У1 + У2

where v = EL=1vec (Gt,;W;F;,tBt), Mf„ = EL=1 Bf ®

(Gt,;W;) andMGy = EL=1 (W.-GtBt)T®Im.Substituting quantities v, M^, and MGt,; into the LMI version of (13), we have

h 0,(14)

where q2 = [-1,0ixMMb], фу > 0 is the slack variables for

, and %i,t = II AGt i II for

s.t. (11), (12), (14), (27), ||BtII2 < Pt, Tt > 0, qt > 0, Xt > 0, vi > 0, ф) > 0, Vt = 1,2, V; = 1,..., l, Vj = 1,..., 2l.

It is clear that the problem T5 is a biconvex SDP with linear objective function, which can be efficiently solved by an iterative algorithm. Furthermore, with fixed Bt/W;, T5 is convex with regard to W;/Bt which can be solved by CVX [18].

3.2 Proposed algorithm and computational complexity analysis

Now, we summarize the proposed beamforming method in Algorithm 1.

The proposed Algorithm 1 will converge to a suboptimal solution as E2=i Yt'n) — E2=i Yt'n-1) < f. Therefore, f is initialized to be a small value, and ATmax is set to limit the number of iterations.

The process of Algorithm 1 with details are as follows: let J ({W;}, {Bt}) represent the objective function

Algorithm 1 The proposed SI-SRINR method

1. Initialize: f = 10—3, Nmax, B(0), set n = 0;

2. Repeat:

1: for n = 0 to Nmax do

2: for fixed W(n—1), B(n—1) update B(n) via solving T5;

for fixed W(n—1), B(n) update B(n via solving T5;

for given B(n and B(n update W(n) and E^ Yt'n) via solving T5;

5: if E2=1 Y(n) — E2=1 Y(n—1) < f, then break;

6: end if 7: end for

Y1 + Y2. At the (n + 1)th iteration, the value of {W,} which can be denoted by |W(n+1^ is the solution to T4 that maximizes the objective J under the constraints. Because T4 is convex (with fixed Wi), updating Bt will only increase or maintain the objective J. By this way, with computed {w(n+1) J, we obtain |b(k+1^ which implies

that J Wi(n-1) , B(n-1)

From the previous inequalities, we observe that


B(n+1)}) > /({

We measure the performance of the proposed Algorithm 1 for each iteration in terms of the computational complexity compared with non-SI-SRINR one by using the total number of floating point operations (FLOPs). A FLOP is defined as a real floating operation, i.e., a real addition, multiplication, division, and so on. The details of the computational complexity of the proposed robust beamforming method is summarized in Table 1. The unknown variables to be determined for Bt is of size n = 2MMb + 3L + 6, and for W, are of size n = 2N2 + 3L + 6, where the first term corresponds to the real and image parts of Bt and W, while the other terms represent the additional slack variables (yt, Tt, gt, h, v., фу). To compute the optimal E2=1 Yt, for t = 1,2., the number of diagonal blocks K is equal to 3, which are related to the SRINR constraint, the individual relay power constraint, and the noise power constraint. By employing (17), and further denoting fis and as as the block dimensions and the number of the variables for S e {iR, gt, yt], respectively, the total FLOPs can be obtained as

RFLOPs = PE O(1)(1 + es)1/2 as (a| + as?2 + в3). s=Pri ,gt ,Yt

Similar to [9], by introducing the slack variables ei, e2, and S, we can recast the non-SI-SRINR method Q1 as

i.e., the objective function increases monotonically with the number of iterations. This observation, coupled with the fact that J ({W,} , {Bt}) is upper-bounded, implies that the proposed algorithm converges to a limit as number n —► to .

Discussion 1: For two-way relay networks, once the second transmission phase finishes, the signal transmitted by the transceiver nodes reappears as self-interference. Without eliminating the self-interference, with the condition of the imperfect CSI, the exactly optimal solution is difficult to obtain. In spite of this, the proposed suboptimal solution is very close to the exactly optimal solution when the CSI uncertainty is small enough and the number of the iterations n —► to in the proposed algorithm.

To better analyze the complexity of Algorithm 1, the standard real-valued SDP problem is given as min ctx, s.t. A0 + E?=1 x,-A,-, where a, denotes the symmetric block-diagonal matrices with K diagonal blocks of size ak x ak, for k = 1,..., K. The number of elementary arithmetic operations for solving this problem is given by [19]

(K \ 1/2 / K K \

1 + Eak) nln2 + nj^al + Ea3 .(17) k=1 / \ k=1 k=1 /

Bt ,Wi

C1 + e-2 + &

ei < at, IBt

aia2 < 1, ei > & > 0, |xRi1 < PRi,

2 < Pt,vi e {1,2}.

We introduce further auxiliary variables 01 > 0 and 02 > 0, and assume < x, 02 < j^. By this way, the constraint ^^ < 1 can be converted into 0102 < 1. By employing Schur-complement theorem [18], we have

0? <--►

022 <--►

1 02 02

(20) (21)

Table 1 Computational complexity of the proposed SI-SRINR algorithm

Step Operations Block dimensions (ak) Number of variables (n)

1 Pr 2MMb+1 2MMb + 2N2 + 6L + 12

2 çt (1 + 1)MN + 1 2N2 + 3L + 6

3.1 tt 1 (2N2 + 3L + 6) x (2MMb + 3L + 6)

3.2 yf 2MN + MMb + 1 (2N2 + 3L + 6) x (2MMb + 3L + 6)

Finally, putting (20) and (21) together, the optimization problem Q2 can be efficiently converted into the following biconvex problem

Q3 : max Bt Wi

ei + e2 + S

01 ± 1

1 02 O2 0,

h 0, L (ei < ai), S > 0,

L (|xr ||2 < , \\Bt||2 < Pt, V i e {1,2},

where L(A) denotes the LMI version of A. Obviously, the constraints L (ei < ai) and L ^|xr. |2 < Pr^ have the same computational complexity to the proposed SI-SRINR method as shown in Table 1. In addition, since the constraints (20) and (21) in Q3 not only request more FOLPs but also lead to lower convergence performance, our proposed SI-SRINR method outperforms non-SI-SRINR one.

Number of iterations

Fig. 1 The convergence performance of the output average worst-case SR versus number of iterations

4 Simulation results

In this section, we study the performance of the proposed SI-SRINR robust beamforming design for TWRN. The channel estimates Gt>i, F,;t are assumed to be reciprocal and identically distributed complex Gaussian random variables. The proposed scenario is considered with two source nodes and L = 2 relay nodes. The source and relay nodes are equipped with Mb = M = N = 4 antennas. We further assume that the noise variances aR,., a^ for i = 1,..., L and t = 1,2, are equally given as a2 = 1. All results are averaged over Nmax = 1000 channel realizations with f = 10-4.

With suboptimal Bt and W. which are obtained by using Algorithm 1, we compare the convergence performance of the average worst-case SR for SI-SRINR method with the non-SI-SRINR one with fixed a. = fa. = 0.01 and transmit SNR = 30 dB as shown in Fig. 1. For non-SI-SRINR method Qi, the near optimal solution is obtained by using (1 + a1 )(1 + a2) ^ a1a2, where at = SRINRt. It is found that the SI-SRINR and the non-SI-SRINR methods can achieve same optimal worst-case SR solution with almost 400 and 700 iterations, respectively. This is reasonable because, for the non-SI-SRINR method, the SR is calculated by using multiplication of SRINR which increases the complexity as discussed in Section 3.2.

In Fig. 2, we compare the proposed SI-SRINR method with the non-SI-SRINR one, non-robust one, and the perfect one with fixed CSI error as a. = fa = 0.03 versus SNR. For the perfect CSI one, the channel coefficients are perfectly known at each node where the channel uncertainties Afy = 0, for t = 1,2, which serves as the performance upper bound for our proposed robust beam-forming design. For the robust one, the nominal values of

the channels F,-,t can be estimated and the channel uncertainties Afy is NBEs as a., for t = 1, and fa., for t = 2, respectively. For the non-robust one, the channel estimates are directly used as the actual channel responses without considering channel uncertainties. It is clear from Fig. 2 that, for different values of SNR, the solution of our proposed robust beamforming design shows better performance than the non-SI-SRINR one and the non-robust one.

In Fig. 3, we compare the average worst-case SR for SI-SRINR method with the non-SI-SRINR one for different CSI errors as 0.01,0.05 versus relay power, where the

SNR [dB]

Fig. 2 The output average worst-case SR versus transmit SNR

■ 4.5

? 3.5 É






ру /X

О SI-SRINR а.=/3.=0.01 —X— Non-SI-SRINR о.=^.=0.01 —©- SI-SRINR а.=(3.=0.05

Non-SI-SRINR а.=Д=0.05

0 2 4 6 8 10 12 14 16 18 PR(dB)

Fig. 3 The output average worst-case SR versus relay power

transmit SNR is given as SNR = 10 dB. It is clear from Fig. 1 that, the solution of our proposed SI-SRINR robust beamforming design shows better performance than the non-SI-SRINR one with increasing relay power. This is because the approximation (1 + д1)(1 + a2) ^ a1a2 loses the performance gain at not extremely high SNR region.

Figure 4 depicts the performance of our proposed SI-SRINR method performance versus the number of the relays Z by comparing with the perfect case and the nonrobust max-power beamforming solution [20] with fixed a, = в, = 0.01. We consider a practical scenario with the

relay power constraints as Pr = 20 dB. It is easy to see that the solution of our proposed SI-SRINR algorithm is close to the perfect one and outperforms the non-robust max-power beamforming one for different values of the transmit power P1 and P2.

5 Conclusions

In this paper, we considered MIMO TWRN with the robust relay beamforming design and proposed an efficient iterative algorithm to solve the SR maximization problem. The worst-case robust design problem was first converted into a SI-SRINR problem. After then, by utilizing the sign-definiteness lemma, the objective problems were represented as the tractable ones which are obtained through the SDP-based iterative optimization. Numerical results showed that the performance of the proposed SI-SRINR robust design is improved compared to the non-SI-SRINR one and non-robust one.

Appendix 1

Since the CSIs are imperfect, the upper bound of Nt cannot be straightforwardly obtained with existent channel uncertainties. Therefore, we employ the ([14] Lemma 1) to solve this problem. For the constraint

Nt = a


+ ai < çt,

assuming ^gt — o^ /oR,. = g*, we have < g*. Using the identity ||X|| = ||vec[X matrix X, we have

EL=1 Gt,iW, | for any given

4.5 г


-Perfect SCI

* SI-SRINR a.=ß.=0.01

—0— Non-Robust max-power [21]

---Perfect SCI

О SI-SRINR a.=ß.=0.01 - $ - Non-Robust max-power [21]

P2 [dB]

Fig.4 The output average SR versus the number ofthe relay Z


= IlELvec [Gt,iWi] I .

Using the identity vec[ ABC] = (CT ® j vec[B], where (■)T and <g> denote the transpose and Kronecker product, we have

J^GtiWi = Ê Gt,iWi+E i=1 i=1 i=1

Ewt ® I

vec (AGt,i) .

Further assuming Ef=1 vec [GyW;] = T, the con-

ii _t || 2

straint | E<=1 Gt,iWi | < g* can be represented in terms of the following LMI

г çt r н 1


Let || TL=i TtiWi |2 = T, [eLLx WT 0 Im] = Vi and insert the structure of 1X^=1 Gt,/Wi || into (25), we have

0 (Vivec (Act,))Hl Vivec (Act,0 Imn

By employing S-Lemma, we can recast (26) as the following matrix inequality:

St - Ei=1 vi TH 0i xmn T

0mnxi —aivi viimn 0mn

Imn —aiVH ••• —aiVH —fav^ •

. . 0mn

: —ai Vi :

: —fai Vi+i :

0mn xi v2l 0mn

vi Imn

vi+i Imn

0i xmn

—Pi vh

v2i imn_

where ai = fApi,! || = \\AGlti ||, Pi = ||Ap.,2 II = |AG2,i || are the norm-bounded errors (NBEs) of channel uncertainties, and 0mn denotes MN x MN zero matrix. This completes the proof.

Appendix 2

(Lemma 1 [14]): Define the functions

fj(x) = xHAjx + 2Re jbfx) + Cj, j = i, 2

where Aj is a square semi-definite matrix and Cj is a real constant. The implication of fj (x) < 0 holds true if and only if there exists X > 0 such that

Ai bi A2 b2

X Ci. _bH C2_

By employing ([14] Lemma 1) and treating the terms involving t = 2 as constants, (15) can be rewritten as

Bi + Xi I vec (Qi )Bi

Bivec (Qi)

where 0 = vec (AqJ B1vec (AqJH + vec (Q2) B2vec (Q2)h - X1 CD*a2 - Pt, wwith (Di = || W? |, with W° denoting optimal solution of Wi.

([21] Theorem 4.2): If D ^ 0, i = 1,2, then the following QMI system

is equivalent to the LMI system: 3X > 0, (28) is satisfied which is shown as

^ 0: (28)

Based on ([21] Theorem 4.2) and define H1 = B1 + X11, H2 = vecjFi,!) p1, H3 = 0, H4 = ®t, H5 = p2vec (Q2)H, H6 = B2, and D = X21, the individual relay power constraints can be converted to the following LMI:

Hi H2 H3 "0 0 0

HH H4 H5 — E Xi 0 I 0

hH h5 H6 i=1 0 0 —Di

Bi + Xi I vec (Qi) Bi 0

______^ h ______~ h

Bivec (Qi) St _ B2vec (Q^

0 vec (Q^ B2 B2 + X21

^ 0, (29)

Hi H2 + H3 X

(H2 + H3X)H H4 + H5X + (H5X)H + XHH6X

^ 0, VX : tr(DjXXH < i):i = i,2,

where St I^2=1 vec(Fi,^Btvec (Fi,t) - X1 c2a2 -X2C2/3f - pRi. This completes the LMI version of the individual relay power constraint.

Competing interests

The authors declare that they have no competing interests. Acknowledgements

This work was supported by MEST2015R1A2A1A05000977, NRF, South Korea, National Natural Science Foundation of China by Grants 61501190 and the Natural Science Foundation of Guangdong Province by Grant 2014A030310389, Shanghai Rising-Star Program (15QA1400100), Innovation Program of Shanghai Municipal Education Commission (15ZZ03), DHU Distinguished Young Professor Program (16D210402), and Key Lab of Information Processing & Transmission of Guangzhou 201605030014.

Author details

1 Division of Electronic and Information Engineering, Chonbuk National University, Jeonju, South Korea. 2School of Electronic and Information Engineering, South China University of Technology, Guangzhou, China. 3School of Information Science and Technology, Donghua University, 436 Shanghai, China. 4School of Mechanical and Electrical Engineering, Guangzhou University, Guangzhou, China.

Received: 14 January 2016 Accepted: 10 June 2016 Published online: 02 July 2016


1. Y Rong, Joint source and relay optimization for two-way linear nonregenerative MIMO relay communications. IEEE Trans. Signal Process. 60(12), 6533-6546 (2012)

2. R Wang, M Tao, Y Liu, Optimal linear transceiver designs for cognitive two-way relay networks. IEEE Trans. Signal Process. 61(4), 992-1005 (2013)

3. Q Shi, M Razaviyayn, Z Luo, C He, An iteratively weighted MMSE approach to distributed sum-utility maximization for a MIMO interfering broadcast channel. IEEE Trans. Signal Process. 59(9), 4331-4340 (2011)

4. L Zhang, Y Cai, R Lamare, M Zhao, Robust multibranch Tomlinson-Harashima precoding design in amplify-and-forward MIMO relay systems. IEEE Trans. Commun. 62(10), 3476-3490 (2014)

5. M Tao, R Wang, Robust relay beamforming for two-way relay networks. IEEE Commun. Lett. 16(7), 1052-1055 (2012)

6. Q Li, Q Zhang, J Qin, Robust beamforming for cognitive multi-antenna relay networks with bounded channel uncertainties. IEEE Trans. Commun. 62(2), 478-487 (2014)

7. H. Tang, W. Chen, J Li, Robust joint source-relay-destination design under per-antenna power constraints. IEEE Trans. Signal Process. 63(10), 2639-2649 (2015)

8. Z Wang, W Chen, Relay beamforming design with SIC detection for MIMO multirelay networks with imperfect CSI. IEEE Trans. Veh. Technol. 62(8), 3774-3785 (2013)

9. P Ubaidulla, S Aissa, Robust two-way cognitive relaying: precoder designs under interference constraints and imperfect CSI. IEEE Trans. Wireless Commun. 13(5), 2478-2489 (2014)

10. J Wang, Y Wang, X Gui, P Zhang, Robust relay precoding design for two-way relay systems with delayed and limited feedback. IEEE Commun. Lett. 17(4), 689-692 (2013)

11. S Ma, Z Dong, J Ma, D Sun, Robust relay beamforming in cognitive two-way relay networks. IEEE Commun. Lett. 17(10), 2000-2003 (2013)

12. EA Jorswieck, EG Larsson, Complete characterization of Pareto boundary for the MISO interference channel. IEEE Trans. Signal Process. 56(10), 5292-5296 (2008)

13. J Liu, F Gao, Z Qiu, Robust transceiver design for downlink multiuser MIMO AF relay systems. IEEE Trans. Wireless Commun. 14(4), 2218-2231 (2015)

14. Y Huang, D Palomar, S Zhang, Lorentz-positive maps and quadratic matrix inequalities with applications to robust MISO transmit beamforming. IEEE Trans. Signal Process. 61 (5), 1121-1130 (2013)

15. A Gupta, A Singer, Successive interference cancellation using constellation structure. IEEE Trans. Signal Process. 55(12), 5716-5730 (2007)

16. M Kobayashi, G Caire, Joint beamforming and scheduling for a multi-antenna downlink with imperfect transmitter channel knowledge. IEEE J. Sel. Areas Commun. 25(7), 1468-1477 (2007)

17. KXu, D Zhang, YXu, W Ma, The equivalence of two optimal power-allocation schemes for A-TWRC. IEEE Trans. Veh. Technol. 63(4), 2478-2489 (2014)

18. S Boyd, L Vandenberghe, Convex Optimization. (Cambridge University Press, Cambridge, UK, 2004)

19. A Ben-Tal, A Nemirovski, Lectures on Modern Convex Optimization: Analysis, Algorithms, Engineering Applications. (SIAM, Philadelphia, PA, USA, 2001)

20. Y Yang, T Chang, M Lin, J Ge, Y Ji, Efficient solutions to distributed beamforming for two-way relay networks under individual relay power constraints. IEEE Trans. Signal Process. 64(4), 1643-1649 (2012)

21. Q Zhang, X Huang, Q Li, J Qin, Cooperative jamming aided robust secure transmission for wireless information and power transfer in MISO channels. IEEE Trans. Commun. 63(3), 906-915 (2015)

Submit your manuscript to a SpringerOpen journal and benefit from:

7 Convenient online submission 7 Rigorous peer review 7 Immediate publication on acceptance 7 Open access: articles freely available online 7 High visibility within the field 7 Retaining the copyright to your article

Submit your next manuscript at 7