Beruflich Dokumente
Kultur Dokumente
AbstractWe consider a full-duplex (FD) decode-andforward system in which the time-switching protocol is employed by the multi-antenna relay to receive energy from
the source and transmit information to the destination. The
instantaneous throughput is maximized by optimizing receive
and transmit beamformers at the relay and the time-split
parameter. We study both optimum and suboptimum schemes.
The reformulated problem in the optimum scheme achieves
closed-form solutions in terms of transmit beamformer for
some scenarios. In other scenarios, the optimization problem is formulated as a semi-definite relaxation problem and
a rank-one optimum solution is always guaranteed. In the
suboptimum schemes, the beamformers are obtained using
maximum ratio combining, zero-forcing, and maximum ratio
transmission. When beamformers have closed-form solutions,
the achievable instantaneous and delay-constrained throughput are analytically characterized. Our results reveal that,
beamforming increases both the energy harvesting and loop
interference suppression capabilities at the FD relay. Moreover,
simulation results demonstrate that the choice of the linear
processing scheme as well as the time-split plays a critical role
in determining the FD gains.
Index TermsFull-duplex, wireless power transfer, decodeand-forward relay, throughput, outage probability.
I. I NTRODUCTION
The emergence of multimedia rich wireless services coupled with ever growing number of subscribers has placed
a high demand for radio resources such as bandwidth and
energy. Most wireless radios so far have adopted half-duplex
(HD) operation where uplink and downlink communication
Mohammadali Mohammadi is with the Faculty of Engineering, Shahrekord University, Shahrekord 115, Iran (email:
m.a.mohammadi@eng.sku.ac.ir).
Batu K. Chalise is with Cleveland State University, 2121 Euclid Avenue,
Cleveland, OH 44115 (email: b.chalise@csuohio.edu).
Himal A. Suraweera is with the Department of Electrical and Electronic
Engineering, University of Peradeniya, Peradeniya 20400, Sri Lanka (email:
himal@ee.pdn.ac.lk).
Caijun Zhong is with the Department of Information Science and Electronic Engineering, Zhejiang University, Hangzhou 310027, China (email:
caijunzhong@zju.edu.cn).
Gan Zheng is with School of Computer Science and Electronic Engineering, University of Essex, UK (email: ganzheng@essex.ac.uk).
I. Krikidis is with the Department of Electrical and Computer
Engineering, University of Cyprus, Nicosia 1678, Cyprus (email:
krikidis@ucy.ac.cy).
This work was presented in part at the IEEE International Workshop on
Signal Processing Advances in Wireless Communications (SPAWC 2015),
Stockholm, Sweden, June/July 2015.
2
E nR nR = R
IMR . As in [19], we assume that the energy
harvested during the energy harvesting phase is stored in a
supercapacitor and then fully consumed by R to forward the
source signal to the destination. This type of operation is also
known as the harvest-use architecture in the literature [21],
[27]. We assume that the harvested energy due to the noise
(including both the antenna noise and the rectifier noise) is
small and thus ignored [19], [27], [31]. Hence, the relay
transmit power can be written as
(2)
Pr = PS khSR k2 ,
d1
where , 1
and denotes the energy conversion
efficiency. Now, let us consider the information transmission
phase. The received signal at R can be expressed as
s
PS
r[n] =
hSR xS [n] + HRR xR [n] + nR [n], (3)
d1
H RR
hSR
h RD
Fig. 1.
MR receive
MT transmit
antennas
antennas
(5)
where accounts for the time delay caused by relay processing. Finally, the received
s signal at D is expressed as
yD [n] =
1
hRD xR [n] + nD [n].
d2
(6)
2
d1 |wr hSR |
,
FD = min
1
2
2
d1 khSR k |wr HRR wt | + 1
2
2
2
, (7)
kh
k
|h
w
|
SR
RD
t
d1 d2
1 Another
2
d1 |wr hSR |
,
max
min
1
2
2
kwr k=kwt k=1
d1 khSR k |wr HRR wt | + 1
2
2
2
. (10)
kh
k
|h
w
|
SR
RD t
d1 d2
In the following subsections, we propose optimum as well
as different suboptimum schemes for solving (10). In the
optimum approach, we propose SDR problem but show that
relaxation does not change the optimality of the solution,
whereas in the suboptimum schemes, different linear receiver/transmitter techniques are employed at R.
A. Optimum Scheme
Since the second-hop SNR does not depend on wr , we
can maximize the first-hop SINR w.r.t wr by fixing wt . In
this case, the optimization problem (10) is re-formulated as
|wr hSR |2
max
,
(11)
Proposition
1: The optimal wt,o is given by
mSINR ,
if f1 (wmSINR ) f2 (wmSINR )
w
MRT ,
wt,o =
if f2 (wMRT ) f1 (wMRT )
otherwise
(15)
where
f1 (wt ) =
HRR wt wt HRR +I
hSR
, hSR
d1
d1
1 khSR k2
|hSR HRR wt |2
1
d1
2
. (13)
= khSR k
2
d1
1 + 1 khSR k kHRR wt k2
d1
1
2
2
khSR k |hSR HRR wt |
d
1
,
max min khSR k2 1 1
d1
1 + d khSR |2 kHRR wt k2
kwt k=1
1
2
2
2
(14)
khSR k |hRD wt | ,
d1 d2
which is still difficult to solve due to its nonconvex nature.
One of the key results of the optimum scheme is presented
in the following proposition.
2
khSR k2 |hRD wt |2
d1 d2
f2 (wt ) =
= min
wt
1
2
d1 khSR k wt HRR hSR hSR HRR wt
wt I +
1
2
d1 khSR k HRR HRR
wt
hRD
,
wMRT = max f2 (wt ) =
wt
||hRD ||
1
2 2
2
2
t 0, min
||hSR || , khSR k ||hRD ||
d1
d1 d2
and P is
P : Find Wt , y
1
s.t. ty khSR k2 y
d1
1
khSR k2 hSR HRR Wt HRR hSR
d
1
1
y = tr Wt I + khSR k2 HRR HRR
d1
2
2
t khSR k hRD Wt hRD
d1 d2
tr (Wt ) = 1, Wt 0.
(16)
1
2
2
khSR k |hSR HRR wt |
1
d
khSR k2 1 1
d1
1 + d khSR k2 kHRR wt k2
ever, for a given t, the problem turns to a convex feasibility problem given in (16). We show that
there is no need to solve this feasibility problem
for all possible values of t. This can be demonstrated as follows. Note that the constraints of the
problem (18)
as
show that t can be upper bounded
1
2
2 2
2
2
t min d ||hSR || , d d khSR k ||hRD || . Conse1
1 2
quently, we can start solving the feasibility problem
(16) in the decreasing order for t. The largest value of
t for which the problem is feasible yields the optimum
Wt . If the optimum Wt is rank-one, then the relaxed
problem (18) is equivalent to the original problem.
B. TZF Scheme
We now present some suboptimum beamforming solutions. The first is the TZF scheme, where relay takes advanmax
t
tage of the multiple transmit antennas to completely cancel
kwt k=1,t
the LI [8]. To ensure this is feasible, the number of the
1
2
2
1
d khSR k |hSR HRR wt |
transmit antennas at relay should be greater than one, i.e.,
s.t. t khSR k2 1 1
d1
1 + d khSR k2 kHRR wt k2 MT > 1. In addition, MRC is applied at the relay input, i.e.,
1
hSR
wr = kh
. After substituting wr into (10), the optimal
2
SR k
2
2
t khSR k |hRD wt | .
(17) transmit beamforming vector wt is obtained by solving the
d1 d2
following problem:
This is a nonconvex quadratic optimization problem
max
|hRD wt |2
with nonconvex constraint. To solve the problem in (17),
kwt k=1
we first apply SDR technique by using a positives.t.
hSR HRR wt = 0.
(19)
semidefinite matrix Wt = wt wt and relaxing the
rank-constraint on Wt . Moreover, define the auxiliary We know that A , HRR hSR hSR HRR is a rank-one
variable
Hermitian matrix with eigenvalue , khSR HRR k2 and
H hSR
1
. Consequently, the eigenvalue
eigenvector x , ||HRR
.
y = tr Wt I + khSR k2 HRR HRR
RR hSR ||
d1
decomposition of A can be given
by x I 1 A = 0
The relaxed optimization problem (17) in terms of Wt , which implies that x I 1 A w
t = 0 for all w
t 6= 0.
y, and t is
Comparing this with the ZF constraint in (19), it is clear that
HRR hSR hSR HRR
max t
,
we
can
take
w
=
B
w
,
where
B
,
I
t
t
Wt ,t,y
khSR HRR k2
without
violating
the
ZF
constraint.
As
such,
the
objective
1
s.t. ty khSR k2 y
t |2 which is maximized
function in (19) reduces to |hRD Bw
d1
with w
t = kc BhRD . Since ||wt || = 1 and B = B2 ,
1
2
1
khSR k hSR HRR Wt HRR hSR
it is clear that kc =
. Consequently, the transmit
d1
||BhRD ||
beamformer for the TZF scheme is given by
1
y = tr Wt I + khSR k2 HRR HRR
BhRD
d1
wtZF =
.
(20)
2
kBhRD k
t khSR k2 hRD Wt hRD
d1 d2
tr (Wt ) = 1, Wt 0.
(18)
The optimization problem (18) is still nonconvex. How- C. RZF Scheme
max
kwr k=1
s.t.
|wr hSR |2
wr HRR hRD = 0.
(21)
D. MRC/MRT Scheme
Finally, we consider the MRC/MRT scheme, where wr
and wt are set to match the first hop and second hop channel,
respectively. Hence,
hSR
hRD
wrMRC =
, wtMRT =
.
(23)
khSR k
khRD k
It is worthwhile to note that the optimum, TZF, and RZF
schemes reduce to the MRC/MRT scheme in the absence
of LI. Although the MRC/MRT scheme is not optimal in
the presence of LI, it could be favored in situations where
compatibility with HD systems is a concern. Moreover, as we
show in Section VI, the MRC/MRT scheme exhibits a very
good performance as compared to other schemes under mild
LI effect. Note that the MRC/MRT scheme requires only
the knowledge of hSR and hRD , whereas the other three
schemes require the knowledge of hSR , hRD , and HRR .
IV. O PTIMIZING FOR I NSTANTANEOUS T HROUGHPUT
In this section, we optimize for the FD beamforming
schemes proposed in the previous section and maximize the
instantaneous throughput which is given by [27]
RI () = (1 ) log2 (1 + FD ).
(24)
f1
+1
W
e
+1
W f 1
1
e
e
< 0 f + 1;
, if e
f1
W
+1
Opt = f1+e
e
0
otherwise,
1+0 ,
(28)
<1
b1
1
b2
1+ 1
or <
0
1+0 ,
we have
ROpt () = (1 ) log2 1 +
f .
1
Therefore, taking the first order derivative of ROpt ()
with respect to , and using the procedure described
in [27], the optimal time portion can be obtained as
1) if
Opt
eW (
f1
e )+1
.
(29)
f 1 + e
0
, the instantaneous throughput
2) Otherwise, if > 1+
0
in (26) is given by
b1
ROpt () = (1 ) log2 1+f 1
.
1 + b2
Taking the first derivative of ROpt () with respect to
yields
dROpt ()
b1
= log2 1 + f 1
d
1 + b2
1
(1 )f b1
,
(1 + b2 )2 log 2 1 + f 1 b1
=
W ( f 1
e )+1
1+b2
1
2
1
d1 |hSR HRR wt,o |
,
min 1
1
2 kH
2
kh
k
w
k
d1
1+
SR
RR
t,o
d1
2
2
.
|h
w
|
RD t,o
d1 d2
B. TZF Scheme
2
1
Let b0 = 21 d |hRD wt,o |2 , b1 =
d1 |hSR HRR wt,o | , and
2
2
2
1
b2 =
d1 khSR k kHRR wt,o k . Hence, (25) is written as
1
ROpt () = (1 ) log2 1 + khSR k2
d1
!!
b1
b0
1
,
.
(26)
min 1
b2 1
1 + 1
(27)
0<<1
(32)
0<<1
be derived as
W a1 1 +1
e ( e ) 1 , if eW ( a1e1 )+1 <
a 1
2
d1 d2
khSR k2 kBhRD k2 , a2 =
a1
1
d1
1 khSR k2
+ 1;
(33)
, and
1 b4 +b5
wrZF
Substituting
into (7), the instantaneous throughput of
the RZF scheme can be written
as
1
RI,RZF () = (1 ) log2 1 + min kDhSR k2 ,
d1
2
2
2
. (34)
kh
k
kh
k
SR
RD
d1 d2
Accordingly, the optimal can be obtained as
W a3 1 +1
e ( e ) 1 , if eW ( a3e1 )+1 < a3 + 1;
a 1
2
RZF = a3 1+eW ( 1e )+1
1
otherwise,
1+2 ,
(35)
2
d1 d2
khSR k2 khRD k2 , a4 =
d1
1 kDhSR k2 ,
and
D. MRC/MRT Scheme
Substituting wrMRC and wtMRT into (7), the instantaneous
throughput of the MRC/MRT scheme can be expressed as
RI,MRC () = (1) log2 (1+
min
1
2
d1 khSR k
2
1
2 |hSR HRR hRD |
d1 khSR k
khSR hRD k2
+1
2
.
(36)
khSR k2 khRD k2
d1 d2
For the notational convenience, we denote b3 =
2
2
2
2
2
d1 d2 khSR k khRD k , b4 = d1 d2 |hSR HRR hRD | , and b5 =
2 1
2
1 d khRD k . Hence, (36) can be written as
2
RI,MRC () = (1 ) log2 (1 + b3
min
!!
1
.
,
1 b4 + b5 1
(37)
(38)
0<<1
3
MRC = a3 1+eW ( 3e )+1
1
otherwise,
1+3 ,
(39)
where 3 =
<
C. RZF Scheme
where a3 =
2 = a3 a4 .
2b
4
.
b5 + b25 +4b4
or <
1
1+3 ,
we have
RI,MRC () = (1 ) log2 1 +
b3 .
1
Therefore, taking the first order derivative of
RI,MRC () with respect to , and following the same
procedure as in optimum scheme, the optimal time
portion can be obtained as
1) if
eW (
a3 1
)+1
e
,
(40)
a3 1 +
2
2
2
where a3 = d
d khSR k khRD k = b3 .
1 2
1
2) Otherwise, if > 1+3 , the instantaneous throughput
in (37) is given by
!
b3
.
RI,MRC () = (1 ) log2 1 +
1 b4 + b5
eW (
a3 1
)+1
e
1 b4
(1 )b3 b4
.
+ b5
1 b4 + b5 + b3 log 2
MR
2 MT +k1
P
D d2
d1 z
(1)k+1
1
1
1
, MT > MR +1,
+
2
(M
+1)
(M
1)(M
)
k!(k+M
)
M
M
k+1
R
R
T
R
T
R
T
1
k=0
2 MR MR
D d2
d1 z
1
1
(z)
FTZF
,
MT = MR +1, (47)
2
(MR +1) 1 + (MR ) (ln (1 ) ln (d1 z) + (1)) R
1
MT 1 MT 1
d1 z
(MR MT +1) d2
,
MT < MR +1.
(MT )(MR )
2
Algorithm 1 The proposed optimum scheme for the instantaneous throughput maximization.
Step 1: Initialize :
Choose from its grid (Line search Method -LS) or
generate an initial point for (Alternating optimization
method-AO) where [0, 1).
Step 2: Obtain the transmit beamformer wt,o using (15).
if (15) requires solving the feasibility problem P of (16)
then
if Wt is rank-one then
Take wt,o as the eigenvector corresponding to nonzero eigenvalue of Wt .
else
Take wt,o as given in Case b of the Appendix I ( see
(82))
end if
end if
Step 4:
if AO method then
while not converged do
Obtain Opt from (28) using wt,o obtained in Step
2.
Update as = Opt and go to Step 2.
end while
Save wt,o , , and the objective function.
else if LS method then
Save wt,o , , and the objective function.
Take another from its grid, and repeat Step 1.
end if
Step 3: Choose the wt,o and that give maximum objective value.
(42)
(43)
1
yd
FY1 (y) =
MT 1, 1 2
2
1
(MT 1)
y > 1 ,
y < 1 .
(45)
1,
T
(MR ) d1 z
2 x
1
xMR1 ex dx,
(46)
B. RZF Scheme
wrZF
wtMRT ,
2 where h
d khSR k + |h1 |
C. MRC/MRT Scheme
The outage probability analysis of the MRC/MRT scheme
for arbitrary MT and MR appears to be cumbersome. Therefore, we now consider two special cases as follows: Case-1)
MT = 1, MR 1 and Case-2) MT 1, MR = 1.
|hSR HRR hRD |2
is given by
Case-1): In this case kh
2
SR hRD k
SR,1 |2
|h
X2 , |wrMRC hRR |2 =
khRR k2 .
(52)
khSR k2
For notational convenience, we define c1 = d1 , c2 =
1
2
1 RR
,
d1
c3 =
expressed as
MRC = min
SR k
kh
SR and X1 =
h
SR k2 +|h
1 |2 . Therefore, the end-to-end
kh
SINR can be re-expressedas
2
2
(48)
RZF = Z1 min 1 X1 , khRD k .
d2
It is well known that Z1 follows central chi-square distribution with 2MR degrees-of-freedom, denoted as Z1 22MR
and that X1 follows a beta distribution with shape parameters
MR 1 and 1, denoted as X1 Beta(MR 1, 1), with [38]
2
0 < x < 1.
(49)
2
2
d2 khRD k ;
,
MR < MT +1,
(MR ) 1
MT
MT
2
1
d1 z
D d2
1
1+
,
2
(MR )
(MT +1) R
1
FRZF (z)
MR = MT +1,
MT MT
d
z
d
(M
M
)
R
T
1
2
2
(MR )(MT +1)
MR > MT +1.
(51)
Proof: See Appendix C.
Proposition 6 indicates that the RZF scheme achieves a
diversity order of min(MR 1, MT ). This result is also
intuitively satisfying since one degree-of-freedom should be
2
d1 d2
SR,1 |2 khRR k2 +1
c 2 |h
, c3 khSR k |hRD |
Let us denote X = c1 / c2 X2 +
(53)
1
Y3
where X2 =
SR,1 |2 khRR k2
|h
and Y = c3 Y3 Y4 , with Y3 = khSR k2 and
khSR k2
2
Y4 = |hRD | . Accordingly, the cdf of MRC in (53) can be
expressed as
FMRC (z) = Pr(min(X, Y ) < z),
(54)
FX2
d z
1
1
1
c2
c1 1
z
y
z
1 FY4
fY3 (y)dy.
c3 y
|h
|2
Note that khRR k2 22MR , Z2 , khSR,1
2 is distributed as
SR k
Z2 Beta(1, MR1) [38], and the cdf of X2 can be readily
evaluated as [39]
1, MR
.
(56)
t
FX2 (t) = G21
23
1, MR , 0
Now, using the cdf of RV Y3 , and substituting (56) into (55)
we obtain
1
(57)
FMRC (z) = 1
(MR )
Z
z
1 c1 1 1, MR
MR 1 y+ c3 y
d zG21
y
e
dy.
23
1
1, MR , 0
c2 z y
2
2
Proof: See Appendix D.
Moreover, by applying a Bessel function approximation for
small arguments [30, Eq. (9.6.9)],
in (59) we can
write
1, M
1
R
21
FMRC
(60)
low (z) 1 G23
2 z 1, M , 0 .
RR
R
Note that (60) presents the outage probability floor and
indicates that the MRC/MRT scheme with MT = 1 exhibits
a zero-diversity order behavior in presence of residual LI.
|hSR HRR hRD |2
Case-2) In this case kh
simplifies to
2
SR hRD k
Y5 , |hRR wtMRT |2 = (hRR t diag{1, 0, , 0}t hRR )
RR,1 |2 ,
= |h
(61)
where t is an unitary matrix and follows from eigen
RR = hRR t . Hence, MRC can be
decomposition and h
written as
!
c1 |hSR |2
2
2
, c |h | khRD k .
MRC = min
RR,1 |2 + 1 3 SR
c2 |hSR |2 |h
2
1
1
while in other cases it can be truncated using few terms up
to 10.
At this point, it is important to determine the value
of that maximizes the throughput. We note that delayconstrained throughput should converge to the ceiling value
of Rc (1) when Pout 0. For each beamforming scheme
we observe that Pout is a complicated function of and it
decreases as the value of is increased. However, this will
lead to the decrease of the term (1 ) at the same time.
Therefore, an optimal value of that maximizes the delayconstrained throughput exists and it can be found by solving
the following optimization problem [27, Eq. (18)]
= arg max R().
(67)
0<<1
Given (46), (50), (57) and (63), unfortunately the optimization problem in (67) does not admit closed-form solutions.
However, the optimal can be solved numerically.
(62)
3
Let us define U = c2 Xc13X
Y5 +1 and V
2
2
|hSR | , Y6 = khRD k . Note that
= c3 X3 Y6 , where X3 =
conditioned on X3 , the
RVs, U and V are independent and hence we have
FMRC (z)
(63)
Z
= 1 d z 1 FU|X3 (z) 1FV |X3 (z) fX3 (x)dx,
1
1
=1
d z
1
1
1e
c 1x (
2
) Q M , z
ex dx.
T
c3 x
1
2 z
RR
1 d1 z X (1)k
(MT ) 1
k!(MT +k)
k=0
!
M
+k
T
1 d2
d1 z
.
(64)
EMT +k
2
1
d
1z
1
AND
D ISCUSSION
c1 x
z 1
ex dx.
MT ,
FMRC (z) 1
d z
(MT )
c
x
1
3
1
(65)
A. Instantaneous Throughput
We consider the influence of optimal time-split and LI
effect on the instantaneous throughput of different beamforming schemes. Fig. 2 shows the instantaneous throughput
versus of the beamforming schemes for a single time frame
and channel realizations. There are two groups of curves: the
OPA (dashed line) and EPA (solid line) curves. OPA and EPA
refer to the cases where source allocates different and equal
power levels for energy harvesting phase and the information
transmission phase respectively. The results for OPA have
been obtained using a two dimentional grid search stratergy
over and the splitting factor that controls the source
power for the energy harvesting phase and the information
transmission phase. It is clear that the OPA scheme achieves
a higher throughput than the EPA scheme over the entire
range of the time-split. We can see that the values of the
optimal calculated by (28), (33), (35), and (39) coincide
with the corresponding ones obtained via simulation. Also, as
3 We note that the typical values for practical parameters used in EH
systems will depend on both the system application and specific technology
used for implementation of RF energy harvesting circuits.
1.2
Simulation, OPA
Maximum, OPA
Simulation, EPA
Analytical, EPA
Optimum
MRC/MRT
Outage Probability
Instantaneous Throughput
10
0.8
0.6
0.4
RZF
10
Asymptotic
2
10
10
TZF
0.2
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
10
0.9
10
Outage Probability
10
10
10
10
10
10
15
20
10
15
20
25
30
35
Ps (dBm)
Fig. 2.
Instantaneous throughput versus for proposed beamforming
schemes (MT = MR = 3, PS = 20 dBm, d1 = 20, d2 = 10 and
= 3).
10
25
30
35
40
Ps (dBm)
Fig. 3. Outage probability versus PS of the TZF and RZF schemes for
different antenna configurations.
Fig. 4.
Outage probability versus PS of the optimum, TZF, RZF,
MRC/MRT schemes for different antenna configurations.
0.6
Optimum
RZF
MRC/MRT
TZF
0.9
0.8
Delayconstrained Throughput
Delayconstrained Throughput
0.5
0.4
0.3
0.2
0.7
0.6
0.5
0.526
0.3
0.4
0.5
0.6
0.7
0.8
0.9
Optimal
MRC/MRT
RZF
TZF
0.1
0.2
46 45 44
0.2
0.1
M =3, M =1
0.522
0.3
0.1
MT=2, MR=2
0.524
0.4
0
60
50
40
30
20
LI strength, (dBm)
10
A PPENDIX A
OF P ROPOSITION 2
s.t.
1
d1
t
y khSR k2 y khSR k2 hSR HRR Wt HRR hSR
1
d1
1
2
y = tr Wt I + khSR k HRR HRR
d1
2
2
t khSR k hRD Wt hRD
d1 d2
tr (Wt ) = 1, Wt 0
(68)
1
2
d1 khSR k HRR HRR .
2
+ khSR k hSR HRR Wt HRR hSR
d1
+ 2 (tr (Wt R) y)
2
+ 3 t khSR k2 hRD Wt hRD
d1 d2
+ 4 (tr(Wt 1)) tr (YWt ),
(69)
(75)
(76)
2
d1 d2
(77)
(78)
1 1 1
2
d1 y d1 khSR k HRR hSR hSR HRR +
2
1
(2 + 4 )I + 2
d1 khSR k HRR HRR .
(79)
2
1
to Y = d1 y1
d1 khSR k HRR hSR hSR HRR which is a
1
rank-one matrix. Therefore, the optimum Wt may not
be rank-one. However, we show that optimum rank-one
matrix can be recovered from optimum Wt without loss
of optimality.
Suppose
Pr the optimum Wt has a rank r where
Wt = q=1 q uq uq . q and uq , (q = 1, , r) are,
respectively, the eigenvalues and eigenvectors of the
matrixPWt . Furthermore, due to the equality constraint
r
(75), q=1 q = 1. Substituting eigenvalue decomposition of Wt into the condition (76), we find that
r
X
q uq Yuq = 0
q=1
h
i
uq HRR hSR hSR HRR uq = 0, q
(80)
r
X
1
2
kh
k
q uq HRR HRR uq = y.
SR
d2
q=1
(83)
2
1
non-zero, 1
d1 khSR k HRR hSR hSR HRR + 2 R +
4 I is a full-rank matrix. On the other hand,
2
2
3 d
d khSR k hRD hRD is a rank-one matrix. Conse1 2
quently, as in Case a, the optimum Wt can be shown to
be a rank-one matrix. Therefore, it is sufficient to show
that both 2 and 4 cannot be zero at the optimality.
Towards this end, we use the method of contradiction.
Assume that 2 = 0 and 4 = 0. Then, Y reduces to
Y
2
1
= 1
d khSR k HRR hSR hSR HRR
1
2
2
3 d
d khSR k hRD hRD .
1
(84)
P ROOF
A PPENDIX B
OF P ROPOSITION 5
MR MT k+1
d z
d z
11
EMT MR +k 11 ,
MT > MR k
(86)
I(k) = MR MT k+1
d z
d
z
MR MT k 11 ,
11
MT MR k
R n x
where n (x) = 1 x e dx [30, Eq. (5.1.5)]. By substituting (86) into (85), and then applying [30, Eq. (5.1.8)]
and [30, Eq. (5.1.12)], we get (87) at the top of theP
next page
n1 1
,
where (1) = 0.57721... and (n) = (1) + m=1 m
for n > 1 [29, Eq. (9.73)]. In the high SNR regime, i.e.,
1 , 2 , omitting higher order items of the series
expansion in (87), the desired result follows after some
simple algebraic manipulations.
P ROOF
A PPENDIX C
OF P ROPOSITION 6
X
d1 d2 z
(1)k
I1 (k)+
k!(k + MT )
2
k=0
MR 1 d z
1
d1 z
1
1
e 1
(MR ) 1
(MT )
!
MT +k
k
X
d1 d2 z
(1)
I2 (k) , (88)
k!(k + MT )
2
k=0
R
where I1 (k) = d1 z xMR MT k1 ex dx is evaluated as
1
MR MT k
d1 z
d1 z
E
M
M
+k+1
T
R
1
1 ,
MT > MR k 1
I1 (k) = MR MT k
d
z
d1 z
M
M
k1
R
T
1 ,
1
MT MR k 1
R M k x
and I2 (k) = d1 z x T e dx is solved as
(89)
k
X
d1 d2 z
(1)
xMR 1 ex dx,
k!(k+MT ) 2 x
k=0
d z
MR , 11
1
+
= 1
(MR )
(MT 1)(MR )
MT +k1
k
X
(1)
d1 d2 z
I(k),
(85)
k!(k + MT )
2
k=0
R
where I(k) = d1 z xMR MT k ex dx, that has closed form
1
solution given by
I2 (k) =
d1 z
1
MT k+1
EMT +k
d1 z
1
(90)
A PPENDIX D
P ROOF OF P ROPOSITION 7
Let Z3 =k hSR k2 |hRD |2 , and observing that X2 and Z3
are independent, we have
d1 d2
1 1
1F
z , (91)
FMRC
low (z) = 1FX2
Z3
2
RR
z
2
MR X
2 MT +k1
d1 z
D d2
1
(1)k
2
(MR )
(MT 1)(MR ) 1
k!(k + MT ) R
k=0
MTMR +k1
d1 z
d1 z
(1)MTMR +k1
ln
+(M
M
+k)
T
R
(MT MR +k)
1
1
d1 z
(1)
,
MT > MR k
+MR MT k+1
1
FTZF (z) = 1
d z
MR , 11
=0
6=MT MR +k1
MTMR k1
d1 z
(M
k
+
1)
R
T
1
2
MR MT k
d z
d1 z
d1 z
d z
1
1
1
, MT MR k
+ + (MRMT k)! 11
e 1 1+ 1 + 2! 1
2
=1
z 2 KMR (2 z),
(92)
(MR )
where we used [29, Eq. (3.471.9)] to derive (92). Finally,
substituting (56) and (92) into (91) yields the desired result.
R EFERENCES
[1] A. Sabharwal et al., In-band full-duplex wireless: Challenges and
opportunities, IEEE J. Sel. Areas Commun., vol. 32, pp. 1637-1652,
Sep. 2014.
[2] B. P. Day, A. R. Margetts, D. W. Bliss, and P. Schniter, Full-duplex
MIMO relaying: Achievable rates under limited dynamic range, IEEE
J. Sel. Areas Commun., vol. 30, pp. 1541-1553, Sep. 2012.
[3] T. Riihonen, S. Werner, and R. Wichman, Hybrid full-duplex/halfduplex relaying with transmit power adaptation, IEEE Trans. Wireless
Commun., vol. 10, pp. 3074-3085, Sep. 2011.
[4] T. Riihonen, S. Werner, and R. Wichman, Mitigation of loopback
self-interference in full-duplex MIMO relays, IEEE Trans. Signal
Process., vol. 59, pp. 5983-5993, Dec. 2011.
[5] M. Duarte, Full-duplex wireless: Design, implementation and characterization, Ph.D. dissertation, Dept. Elect. and Computer Eng., Rice
University, Houston, TX, 2012.
[6] D. Korpi, T. Riihonen, V. Syrjala, L. Anttila, M. Valkama, and R.
Wichman, Full-duplex transceiver system calculations: Analysis of
ADC and linearity challenges, IEEE Trans. Wireless Commun., vol.
13, pp. 3821-3836, July 2014.
[7] E. Aryafar, M. A. Khojastepour, K. Sundaresan, S. Rangarajan and
M. Chiang, MIDU: Enabling MIMO full-duplex, in Proc. 18th
Annual Intl. Conf. Mobile Computing and Networking (MobiCom
2012), Istanbul, Turkey, Aug. 2012, pp. 257-268.
[8] H. A. Suraweera, I. Krikidis, G. Zheng, C. Yuen and P. J. Smith, Lowcomplexity end-to-end performance optimization in MIMO full-duplex
relay systems, IEEE Trans. Wireless Commun., vol. 13, pp. 913-927,
Feb. 2014.
[9] H. Q. Ngo, H. A. Suraweera, M. Matthaiou and E. G. Larsson, Multipair full-duplex relaying with massive arrays and linear processing,
IEEE J. Sel. Areas Commun., vol. 32, pp. 1721-1737, Sep. 2014.
[10] B. Medepally and N. B. Mehta, Voluntary energy harvesting relays
and selection in cooperative wireless networks, IEEE Trans. Wireless
Commun., vol. 9, pp. 3543-3553, Nov. 2010.
[11] Z. Ding, C. Zhong, D. W. K. Ng, M. Peng, H. A. Suraweera, R.
Schober and H. V. Poor, Application of smart antenna technologies
in simultaneous wireless information and power transfer, IEEE Commun. Mag., vol. 53, pp. 86-93, Apr. 2015.
[12] K. Huang and X. Zhou, Cutting last wires for mobile communication
by microwave power transfer, IEEE Commun. Mag., vol. 53, pp. 8693, June 2015.
[13] R. Zhang and C. Ho, MIMO broadcasting for simultaneous wireless
information and power transfer, IEEE Trans. Wireless Commun., vol.
12, pp. 1989-2001, May 2013.
[14] L. R. Varshney, Transporting information and energy simultaneously,
in Proc. IEEE Intl. Symp. Inf. Theory (ISIT 2008), Toronto, Canada,
Jul. 2008, pp. 1612-1616.
(87)