Hindawi

Mathematical Problems in Engineering

Volume 2017, Article ID 5164681, 8 pages
https://doi.org/10.1155/2017/5164681

Research Article
Linear Precoding Scheme Design for MIMO Two-Way Relay
Systems with Imperfect Channel State Information

Xiao-min Chen, Jun-xu Su, Qiu-ming Zhu, Xu-jun Hu, and Zhu Fang
College of Electronic and Information Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing, China

Correspondence should be addressed to Xiao-min Chen; chenxm402@nuaa.edu.cn

Received 16 November 2016; Revised 16 February 2017; Accepted 1 March 2017; Published 12 April 2017

Academic Editor: Nazrul Islam

Copyright © 2017 Xiao-min Chen et al. This is an open access article distributed under the Creative Commons Attribution License,
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

The aim of this paper is to investigate a linear precoding scheme design for a multiple-input multiple-output two-way relay system
with imperfect channel state information. The scheme design is simplified as an optimal problem with precoding matrix variables,
which is deduced with the maximum power constraint at the relay station based on the minimum mean square error criterion. With
channel feedback delay at both ends of the channel and the channel estimation errors being taken into account, we propose a matrix
decomposition scheme and a joint iterative scheme to minimize the average sum mean square error. The matrix decomposition
method is used to derive the closed form of the relay matrix, and the joint iterative algorithm is used to optimize the precoding
matrix and the processing matrix. According to numerical simulation results, the matrix decomposition scheme reduces the system
bit error rate (BER) effectively and the joint iterative scheme achieves the best performance of BER against existing methods.

1. Introduction relay system. In [9], the precoding algorithm of amplify-

Multiple-input multiple-output (MIMO) technology has
become the key technology owing to its ability to increase
system capacity and improve spectral efficiency without
increasing the bandwidth [1]. The relay technology is a
common space diversity method that can effectively reduce
the effects of channel fading. The combination of MIMO with
relay technology can further improve the capacity and system
performance of the relay network. There has been extensive
theoretical research on the performance improvement of
unidirectional MIMO relay system [2, 3]. In fact, the MIMO
two-way relay system has received great deal of attention
recently owing to its high spectrum efficiency [4, 5].
Some existing studies have investigated for MIMO relay
systems. In the actual communication system, the reliability
of the communication link could be ensured by minimizing
the mean square error (MSE) of the receiver. In references
[6, 7] analysis under the condition of perfect channel state
information (CSI), the precoding algorithm regards the MSE
at two source nodes as the optimization target; the study [8]
presents the complete CSI and the joint optimization method
based on the criterion of MSE duality of two-way MIMO
and-forward MIMO two-way relay system based on channel
capacity analysis is studied under limited channel feedback
condition. However, the precoding scheme only considered
the power constraints of the relay node without considering
the power constraints of the transmitter. The paper [10]
details the design of the combined precoding scheme for
the two-way relay system, using the iterative method to
optimize the combined precoding matrix. However, due to
the time-varying wireless channel noise, the existence of the
desired CSI is not realistic. References [11–13] researched
for the amplify-and-forward two-way MIMO relay system,
assuming that, in the relay terminal known source-relay, relay
destination channel from the channel estimation errors and
transmit antenna correlation proposed a joint transceiver
design scheme based on the imperfect CSI. The study [14]
presents the precoding algorithm with consideration channel
feedback delay and channel estimation errors; however, it is
only suitable for the MIMO system.
Although some excellent works about precoding design
have been done for MIMO two-way relay networks [15–
17], most of them have not taken the channel estimation
errors and feedback delay into account. However, in practical
2 Mathematical Problems in Engineering

2.2. Channel Model. Considering the channel estimation

H1 H2 error and channel feedback delay, the channel matrix at time
.. .. .. ..
S1 . F S2
. .
G2
. instant 𝑡 can be expressed as [18, 19]
G1
ns nr nr ns
̂ 𝑡 + T 𝑡 + Ξ𝑡 ,
H𝑡 = H (3)
Figure 1: Diagram of MIMO two-way relay system.

where Ξ𝑡 denotes the channel estimation error matrix and T𝑡

is the delay estimation error matrix. With a certain amount
networks, due to the limitation of the channel estimation of estimation error the channel matrix H𝑡 changes to be H ̂𝑡.
method and the existence of channel feedback delay, the ideal In addition, after experiencing a period of time 𝜏 for feedback
CSI is difficult to obtain. This motivates us to investigate ̂ 𝑡−𝜏 . Then the channel matrix H𝑡 can
̂ 𝑡 turns to be √𝜌H
delay, H
the problem of optimal precoding design in MIMO two-
be written as [19]
way relay networks in the presence of channel estimation
errors and feedback delay. In this paper, a MIMO two-way
relay system is considered where the channel estimation error ̂ 𝑡−𝜏 + T𝑡 + Ξ𝑡 ,
H𝑡 = √𝜌H (4)
and feedback delay between relay node and the destination
exist. At the relay node, the linear precoding design method where 𝜌 is the channel correlation coefficient formulated as in
is produced based on the minimum mean square error [19]. For Clarke’s fading spectrum, 𝜌 could be obtained as 𝜌 =
(MMSE) rule. Finally, the optimal precoding matrix and the 𝐽02 (2𝜋𝑓𝑑 𝜏), and here 𝐽0 (∙) is the zeroth-order Bessel function
destination linear matrix are derived using the theoretical of the first kind and 𝑓𝑑 is the Doppler frequency [20].
proof. In this paper, we discuss the channel matrix of source-
relay and relay-source at a certain time, and correlation
coefficient 𝜌 is related to the delay coefficient 𝜏. For the
2. System Model and Channel Model ̂ 𝑡−𝜏,𝑖 could be written
convenience of expression, H𝑡,𝑖 and H
2.1. System Model. Considering MIMO two-way relay system ̂
as H𝑡 and H𝑖 . Therefore, our channel matrix could be further
as shown in Figure 1, which consists of two source nodes 𝑆1 expressed as [21]
and 𝑆2 with one relay node denoted by F, both 𝑆1 and 𝑆2 are
equipped with 𝑛𝑠 antennas. Relay node F has 𝑛𝑟 antennas. ̂ 𝑖 + T 𝑖 + Ξ𝑖 .
H𝑖 = √𝜌𝑖 H (5)
At present, the research on the performance of MIMO two-
way relay system is based on the model of time division
duplex (TDD). During the first phase, source nodes 𝑆1 and Ξ𝑡 is independent of T𝑖 and its elements are subjected to
𝑆2 transmit their information to relay node F. In the second CN(0, 𝜎𝑒2 ). CN(𝑢, 𝜎2 ) represents the complex Gauss distribu-
time slot, relay node multiplies its received signal by a linear tion with a mean value of 𝑢 and a variance of 𝜎2 . Let Σ𝑖 =
precoding matrix F ∈ C𝑁𝑟 ×𝑁𝑟 and forwards it to 𝑆1 and T𝑖 + Ξ𝑡 and H𝑡 can be noted as
𝑆2 , respectively. It is assumed that all nodes are operating in
half-duplex mode due to the hardware complexity and the H𝑖 = √𝜌𝑖 H𝑖 + Σ𝑖 . (6)
relay node transmits and receives in two orthogonal time
slots.
Each element of Σ𝑖 is subjected to CN(0, (1−𝜌𝑖2 )(1−𝜎𝑒2𝑖 )+𝜎𝑒2𝑖 ).
In the first time slot, source nodes 𝑆𝑖 (𝑖 = 1, 2) transmit
information x𝑖 ∈ C𝑛𝑠 ×1 to relay node, x𝑖 is satisfied with Let 𝜎Σ2 𝑖 = (1 − 𝜌𝑖2 )(1 − 𝜎𝑒2𝑖 ) + 𝜎𝑒2𝑖 . The receiver signal ỹ𝑖 at 𝑆𝑖 is
covariance matrix R𝑥𝑖 = 𝜀[x𝑖 x𝑖𝐻], 𝜀[∙] donates the statistical
𝐻
expectation, and then the signal vector y𝑠 ∈ C𝑛𝑟 ×1 received at ỹ𝑖 = y𝑖 − 𝜌𝑖 H𝑖 FH𝑖 x𝑖 = H𝐻 𝐻
𝑖 FH𝑗 x𝑗 + H𝑖 Fn𝑟 + n𝑖 + k𝑖 ,
(7)
relay node is
𝐻
y𝑠 = H1 x1 + H2 x2 + n𝑟 . (1) where k𝑖 = (H𝐻 𝑖 FH𝑖 − 𝜌𝑖 H𝑖 FH𝑖 )x𝑖 is the residual self-inter-
ference (SI) with covariance matrix R𝑘𝑖 = 𝜀[k𝑖 k𝑖𝐻]. When the
Here H𝑖 ∈ C𝑛𝑟 ×𝑛𝑠 represents the channel matrix of 𝑆𝑖 to F detection matrix Q𝑖 is employed by 𝑆𝑖 , the mean squared error
and n𝑟 ∈ C𝑛𝑟 ×1 denotes the additive white Gaussian noise (MSE) of the detected signal at 𝑆𝑖 can be expressed as below:
(AWGN) vector with covariance matrix R𝑛𝑟 = 𝜀[n𝑟 n𝐻 𝑟 ].
󵄩 󵄩2
In the second time slot, relay node multiplies its received MSE𝑖 (F, Q𝑖 ) = 𝜀 (󵄩󵄩󵄩󵄩Q𝑖 ỹ𝑖 − x𝑗 󵄩󵄩󵄩󵄩 ) . (8)
signal and forwards it to 𝑆1 and 𝑆2 , respectively. The received
signal y𝑖 ∈ C𝑛𝑠 ×1 at 𝑆𝑖 can be expressed as
3. Problem Formulation
y𝑖 = H𝐻
𝑖 FH𝑗 x𝑗 + H𝐻
𝑖 FH𝑖 x𝑖 + H𝐻
𝑖 Fn𝑟 + n𝑖 , (2) In this paper, a joint design of the relay precoding matrix
F and the detection matrixes Q1 and Q2 is proposed with
where 𝑗 = 2 if 𝑖 = 1 and 𝑗 = 1 if 𝑖 = 2. n𝑖 ∈ C𝑛𝑠 ×1 denotes the the maximum transmission power constraint based on the
AWGN vector with covariance matrix R𝑛𝑖 = 𝜀[n𝑖 n𝐻 𝑖 ]. MMSE criterion [22]. Taking the channel feedback delay and
Mathematical Problems in Engineering 3

estimation errors into account, the MSE expression of 𝑆𝑖 can Tr [𝜀Σ𝑖 (Q𝑖 H𝐻 𝐻 𝐻
𝑖 FR𝑛𝑟 F H𝑖 Q𝑖 )]
be further represented as [23]
𝐻
= Tr {𝜀Σ𝑖 [Q𝑖 (√𝜌𝑖 H𝑖 + Σ𝐻
𝑖 )
󵄩 󵄩2
MSE𝑖 (F, Q𝑖 ) = Tr {𝜀Σ𝑖 [󵄩󵄩󵄩󵄩Q𝑖 ỹ𝑖 − x𝑗 󵄩󵄩󵄩󵄩 ]} ⋅ FR𝑛𝑟 F𝐻 (√𝜌𝑖 H𝑖 + Σ𝑖 ) Q𝐻
𝑖 ]}
𝐻
= Tr {𝜀Σ1 ,Σ2 [(Q𝑖 H𝐻 𝐻
𝑖 FH𝑗 ) R𝑥𝑗 (Q𝑖 H𝑖 FH𝑗 ) ]}
𝐻
= 𝜌𝑖 Tr [Q𝑖 H𝑖 FR𝑛𝑟 F𝐻H𝑖 Q𝐻
𝑖 ]

+ Tr [𝜀Σ𝑖 (Q𝑖 H𝐻 𝐻 𝐻
𝑖 FR𝑛𝑟 F H𝑖 Q𝑖 )] + Tr [Q𝑖 Z𝑖 Q𝐻 𝐻
𝑖 Tr (FR𝑛𝑟 F )] ,
(9)
− Tr {2 Re [𝜀Σ1 ,Σ2 (Q𝑖 H𝐻
𝑖 FH𝑗 R𝑥𝑖 )]} Tr {2 Re [𝜀Σ1 ,Σ2 (Q𝑖 H𝐻
𝑖 FH𝑗 R𝑥𝑖 )]}

+ Tr [𝜀Σ𝑖 (Q𝑖 R𝑘𝑖 Q𝐻

𝑖 )] + Tr (R𝑥𝑗 )
𝐻
= 2√𝜌𝑖 𝜌𝑗 Tr [Re (Q𝑖 H𝑖 FH𝑗 R𝑥𝑖 )] ,

+ Tr (Q𝑖 R𝑛𝑖 Q𝐻
𝑖 ),
(11)
𝐻
where Π𝑗 = H𝑗 R𝑥𝑗 H𝑗 + Tr(R𝑥𝑗 )Z𝑖 ; substituting (10)∼(11) into
where Tr[∙]is the trace of the matrix and Re[∙] denotes the (9), the original expression (9) can be simplified as
real part. It is assumed that each of the elements in a random
matrix x ∈ C𝑛×𝑛 is an independent and identically distributed 𝐻
MSE𝑖 (F, Q𝑖 ) = 𝜌𝑖 Tr (Q𝑖 H𝑖 FΘ𝑖 F𝐻H𝑖 Q𝐻
𝑖 ) + Tr (R𝑠𝑗 )
zero mean complex Gauss random variable, x is satisfied with
Tr(xAx𝐻) = 𝜎𝑥2 I𝑛 , and here I𝑛 is 𝑛 × 𝑛 unit matrix. We assume
+ Tr (Q𝑖 Φ𝑖 Q𝐻
𝑖 ) (12)
the variance of Σ𝑖 is much smaller than one. Hence, we have
𝐻
− 2√𝜌𝑖 𝜌𝑗 Re [Tr (Q𝑖 H𝑖 FH𝑗 R𝑥𝑖 )] ,
Tr [𝜀Σ𝑖 (Q𝑖 R𝑘𝑖 Q𝐻
𝑖 )]
where
𝐻
= 𝜌𝑖 Tr {𝜀Σ𝑖 [Q𝑖 (H𝑖 FΣ𝑖 R𝑥𝑖 Σ𝐻 𝐻
𝑖 F H𝑖 Θ𝑖 = Π𝑗 + R𝑛𝑟 + Tr (R𝑥𝑖 ) Z𝑖 ,
𝐻 𝐻 𝐻 𝐻 (13)
+ Σ𝐻
𝑖 FH𝑖 R𝑥𝑖 H𝑖 F Σ𝑖 + H𝑖 FΣ𝑖 R𝑥𝑖 H𝑖 F𝐻Σ𝑖 𝐻
Φ𝑖 = Tr [F (Π𝑗 + R𝑛𝑟 + 𝜌𝑖 H𝑖 R𝑥𝑖 H𝑖 ) F𝐻Z𝑖 + R𝑛𝑖 ] .
𝐻 𝐻
(10)
+ H𝑖 FΣ𝑖 R𝑥𝑖 H𝑖 F𝐻Σ) Q𝐻
𝑖 ]} We are now ready to design detection matrix Q𝑖 and precod-
𝐻 ing matrix F to minimize the average sum MSE of 𝑆𝑖 . The
= 𝜌𝑖 Tr [Q𝑖 H𝑖 FZ𝑖 F𝐻H𝑖 Q𝐻
𝑖 Tr (R𝑥𝑖 ) problem can be formulated as
𝐻
+ Tr (FH𝑖 R𝑥𝑖 H𝑖 F𝐻) Q𝑖 Z𝑖 Q𝐻 min MSE = MSE1 (F, Q1 ) + MSE2 (F, Q2 )
𝑖 ]. Q1 ,Q2 ,F
(14)
s.t. Tr (FR𝑟 F𝐻) ≤ 𝑃𝑟
Here Z𝑖 = 𝜎Σ2 𝑖 I𝑛𝑠 . In the same way, some simplifications can
be written as and here

R𝑟 = 𝜀Σ𝑖 [y𝑠 y𝑠𝐻] = Π1 + Π2 + R𝑛𝑟 . (15)

𝐻
Tr {𝜀Σ1 ,Σ2 [(Q𝑖 H𝐻
𝑖 FH𝑗 ) R𝑥𝑗 (Q𝑖 H𝐻
𝑖 FH𝑗 ) ]}
𝐻 𝐻
4. The MMSE-Based Joint Precoding
= 𝜌𝑖 𝜌𝑗 Tr (Q𝑖 H𝑖 FH𝑗 R𝑥𝑗 H𝑗 F𝐻H𝑖 Q𝐻
𝑖 ) Scheme Design
𝐻 4.1. Matrix Decomposition Algorithm Design. Since the joint
+ 𝜌𝑖 Tr [Q𝑖 H𝑖 FZ𝑖 F𝐻H𝑖 Q𝐻
𝑖 Tr (R𝑥𝑖 )]
iterative algorithm is being proposed, this paper introduces
𝐻 a kind of matrix decomposition algorithm with relatively
+ 𝜌𝑗 Tr [Q𝑖 Q𝐻 𝐻
𝑖 Tr (FH𝑗 R𝑥𝑗 H𝑗 F Z𝑖 )] low computational complexity. For (12), when the precoding
𝐻
matrix F is determined, the optimal linear detection matrix
+ 𝜌𝑖 Tr {Q𝑖 H𝑖 H𝑖 Q𝐻 𝐻
𝑖 Tr [FZ𝑖 F Tr (R𝑥𝑖 )]} Q𝑖 can be uniquely determined.
From the following condition (𝜕MSE/𝜕Q)|Q𝑖 =Q∗𝑖 = 0, Q𝑖
𝐻
= 𝜌𝑖 Tr (Q𝑖 H𝑖 FΠ𝑗 F𝐻H𝑖 Q𝐻
𝑖 )
can be written as
𝐻 𝐻 −1
+ Tr [Q𝑖 Z𝑖 Q𝐻 𝐻
𝑖 Tr (FΠ𝑗 F )] ,
Q𝑖 = 𝜌𝑗 R𝑥𝑖 H𝑗 F𝐻H𝑗 (𝜌𝑖 H𝑖 FΘ𝑖 F𝐻H𝑖 + Φ𝑖 ) . (16)
4 Mathematical Problems in Engineering

Substituting (16) into (12), then (12) can be expressed as Here, UΞ is unitary, Λ𝐹 is 𝑛𝑟 × 𝑛𝑟 diagonal, and U𝑌 is the
nonsingular matrix obtained by the generalized singular
MSE𝑖 (F, Q𝑖 ) = Tr (R𝑥𝑗 ) value decomposition (GSVD) from Y1 and Y2 . Y𝐻 𝑖 can be
written as
𝐻 𝐻 −1
− 𝜌𝑖 𝜌𝑗 Tr [R𝑥𝑗 H𝑗 F𝐻H𝑖 (𝜌𝑖 H𝑖 FΘ𝑖 F𝐻H𝑖 + Φ𝑖 )
Y𝐻 𝐻
𝑖 = V𝑌𝑖 Λ𝑌𝑖 U𝑌 , (24)
(17)
𝐻
⋅ H𝑖 FH𝑗 R𝑥𝑗 ] = Tr (R𝑥𝑗 ) where V𝑌𝑖 is unitary and Λ𝑌𝑖 is diagonal. U𝐻
Ξ is obtained from
the following singular value decomposition (SVD):
𝐻
− 𝜌𝑗 Tr (R𝑥𝑗 H𝑗 Θ−1
𝑖 H𝑗 R𝑥𝑗 ) + 𝑝𝑖 (F) , Λ
Ξ1/2 ̃ Ξ ) ( Ξ ) 𝑈H
= (𝑉Ξ𝑖 𝑉 (25)
𝑖 Ξ
where
𝑖
0

𝑝𝑖 (F) and here ΛΞ is 𝑛𝑟 × 𝑛𝑟 diagonal, from (25), and Ξ1/2 =

𝑖
𝐻 𝐻 VΞ𝑖 ΛΞ U𝐻
Ξ . Substituting (23)∼(25) into (22) gives
= 𝜌𝑗 Tr [R𝑥𝑗 H𝑗 Θ−1/2
𝑖 (𝜌𝑖 Q1/2 𝐻 −1 1/2
𝑖 F H𝑖 Φ𝑖 H𝑖 FQ𝑖 (18)
−1
−1 𝑝𝑖 (F) = 𝜌𝑗 Tr [A𝑖 (𝜌𝑖 V𝐻 2 2 2
Ξ𝑖 VΞ𝑖 ΛΞ Λ𝐹 Λ𝑌𝑖 + I𝑛𝑠 ) ] (26)
+ I𝑛𝑠 ) Θ−1/2
𝑖 H𝑗 R𝑥𝑗 ] .
and here A𝑖 = V𝐻 𝑌𝑖 Λ𝑋𝑖 V𝑌𝑖 . In order to achieve some simple
Observing that only the term 𝑝𝑖 (F) is related to F, the solutions, we further relax the problem by only considering
optimization problem in (14) is equivalent to minimizing the main diagonal of V𝐻 Ξ𝑖 VΞ𝑖 . Finally, the problem in (20) is
𝑝1 (F) + 𝑝2 (F). Assuming 𝑝𝑖 (F) ≤ 𝑝𝑖 (F) by contraction simplified to the following problem:
method, where
−1
𝑝𝑖 (F) min 𝜌𝑗 Tr [A𝑖 (I𝑛𝑠 + UΞ𝑖 Λ2Ξ Λ2𝐵𝑖 Λ2𝐹 ) ]
Λ𝐹
𝐻 −1 𝐻
(27)
= 𝜌𝑗 Tr [Θ−1/2
𝑖 H𝑗 R𝑥2 𝑗 H𝑗 Θ−1/2
𝑖 (𝜌𝑖 Θ1/2 𝐻 1/2
𝑖 F H𝑖 Φ𝑖 H𝑖 FΘ𝑖 (19) s.t. Tr (DΛ2𝐹 ) ≤ 𝑃𝑟 ,
−1
+ I𝑛𝑠 ) ] where UΞ𝑖 = diag(V𝐻 −1 −𝐻
Ξ𝑖 VΞ𝑖 ) and D = U𝐵 R𝑟 U𝐵 ; the optimiza-
tion problem (27) can be rewritten in scalar form as
and here Φ𝑖 = 𝑃𝑟 Z𝑖 + R𝑛𝑖 , hence the original optimization
2 𝑛𝑠 𝜌𝑖 𝜌𝑗 𝜛𝑖𝑛
problem (14) can be simplified as
min ∑∑
𝑖=1 𝑛=1 1 + 𝜇𝑖𝑛 𝜂𝑛
𝜂 ,𝜂 ,...,𝜂
1 2 𝑛𝑠
min MSE = 𝑝1 (F) + 𝑝2 (F) (28)
F
(20) 𝑛𝑠

s.t. Tr (FR𝑟 F𝐻) ≤ 𝑃𝑟 . s.t. ∑ 𝑑𝑛 𝜂𝑛 ≤ 𝑃𝑟 ,

𝑛=1
Next, using matrix decomposition method to simplify the
structure of 𝑝𝑖 (F), it can be rewritten as where 𝜂𝑛 , 𝜇𝑖𝑛 , 𝜛𝑖𝑛 , and 𝑑𝑛 are the diagonal entries of Λ2𝐹 ,
UΞ𝑖 Λ2Ξ Λ2𝐵𝑖 , A𝑖 , and D. It is easy to recognize that (28) is a con-
−1
𝑝𝑖 (F) = Tr [X𝑖 (Θ1/2 𝐻 1/2
𝑖 F Ξ𝑖 FΘ𝑖 + I𝑛𝑠 ) ] (21) vex optimization problem [24, 25]; translating the nonconvex
problem of formula (28) into a convex optimization problem
𝐻 −1 𝐻 by Lagrange multiplier method, 𝜆 is the Lagrange multiplier,
and here Ξ = H𝑖 Φ𝑖 H𝑖 and X𝑖 = Θ−1/2
𝑖 H𝑗 R𝑥2 𝑗 H𝑗 Θ−1/2
𝑖 . X𝑖 and the Lagrange function is constructed for
can be expressed as X𝑖 = U𝑋𝑖 Λ𝑋𝑖 U𝐻𝑋𝑖 by EVD decomposition,
2 𝑁𝑠 𝜌𝑖 𝜌𝑗 𝜛𝑖𝑛 𝑁
U𝑋𝑖 is unitary matrix, and Λ𝑋𝑖 is diagonal matrix. Expression
𝐿 (𝜂𝑛 , 𝜆) = ∑ ∑ + 𝜆 ( ∑ 𝑑𝑛 𝜂𝑛 − 𝑃𝑟 ) . (29)
𝑖=1 𝑛=1 1 + 𝜇𝑖𝑛 𝜂𝑛
(21) can be described as
𝑛=1

𝑝𝑖 (F) 𝜕𝐿/𝜕𝜂𝑛 = 0 gives

−1
= 𝜌𝑗 Tr [Λ𝑋𝑖 U𝐻 1/2 𝐻 𝐻/2 1/2
𝑋𝑖 (Θ𝑖 F Ξ𝑖 Ξ𝑖 FΘ1/2
𝑖 + I𝑛𝑠 ) (22) 𝜂𝑛

−1 2 − 4𝜆𝑑 𝜇2 (𝜆𝑑 − ∑2 𝜌 𝜌 𝜇 𝜛 )
−2𝜆𝑑𝑛 𝜇𝑖𝑛 + √4𝜆2 𝑑𝑛2 𝜇𝑖𝑛
⋅ U𝑋𝑖 ] = 𝜌𝑗 Tr [Λ𝑋𝑖 (Y𝐻 𝐻 𝐻/2 1/2
𝑖 F Ξ𝑖 Ξ𝑖 FY𝑖 + I𝑛𝑠 ) ] =
𝑛 𝑖𝑛 𝑛 𝑖=1 𝑖 𝑗 𝑖𝑛 𝑖𝑛
2
2𝜆𝑑𝑛 𝜇𝑖𝑛 (30)
and here Y𝑖 = Θ1/2
𝑖 U𝑋𝑖 . We propose the following structure:
1 2 𝜌𝑖 𝜌𝑗 𝜛𝑖𝑛
=− + √∑ .
F= UΞ Λ𝐹 U−1
𝑌 . (23) ∑2𝑖=1 𝜇𝑖𝑛 𝑖=1 𝜆𝑑𝑛 𝜇𝑖𝑛
Mathematical Problems in Engineering 5

Step of Joint Optimization of Iterative Algorithm

Step 1. Initialize x𝑖(0) = I𝑛𝑠 , F(0) = √𝑃𝑟 /Tr(R𝑟 )I𝑛𝑠 , 𝜁 > 0, 𝑛 = 0, Itermax
Step 2. Repeat
Step 3. Increment counter 𝑛 ← 𝑛 + 1
Step 4. Optimize and update Φ(𝑛) (𝑛)
1 , Φ2
(𝑛) (𝑛)
Step 5. Optimize and update Q1 , Q2
Step 6. Optimize and update F(𝑛)
Step 7. Until ‖minQ(𝑛) ,Q(𝑛) ,F(𝑛) MSE − minQ(𝑛−1) ,Q(𝑛−1) ,F(𝑛−1) MSE‖2𝐹 ≤ 𝜁 or 𝑛 > Itermax
1 2 1 2
Step 8. Compute B and 𝜆, F(𝑛) ← Fopt and Q(𝑛) (𝑛)
1 ← Q1,opt , Q2 ← Q2,opt

Algorithm 1: Joint optimization of iterative algorithm.

𝜆 is in accord with and from (34) and (35) one has

2 𝜌𝑖 𝜌𝑗 𝜇𝑖𝑛 𝜛𝑖𝑛 2 𝜌𝑖 𝜌𝑗 𝜇𝑖𝑛 𝜛𝑖𝑛
𝜆=∑ ≤∑ vec (F) = Γ−1 vec (Q) , (38)
2 𝑑𝑛
𝑖=1 𝑑𝑛 (1 + 𝜇𝑖𝑛 𝜂𝑛 ) 𝑖=1
(31) where
2 𝜌𝑖 𝜌𝑗 𝜇𝑖𝑛 𝜛𝑖𝑛 2
≤ max {∑ , ∀ = 1, 2, . . . , 𝑛𝑠 } Γ = ∑Θ𝑇𝑖 ⊗ (𝜌𝑖 H𝑖 Q𝐻
𝐻
𝑖=1 𝑑𝑛 𝑖 Q𝑖 H𝑖 )
𝑖=1
and then
2
2 𝜌𝑖 𝜌𝑗 𝜇𝑖𝑛 𝜛𝑖𝑛 + ∑Ω𝑇𝑗 ⊗ Tr (Q𝑖 Z𝑖 Q𝐻 𝑇
0 ≤ 𝜆 ≤ max {∑ , ∀ = 1, 2, . . . , 𝑛𝑠 } . (32) 𝑖 ) + 𝜆R𝑟 ⊗ I𝑛𝑠 , (39)
𝑖=1 𝑑𝑛 𝑖=1

2
𝜆 should be chosen from bisection algorithm and satisfied 𝐻
𝑛𝑠
with ∑𝑛=1 𝑑𝑛 𝜂𝑛 = 𝑃𝑟 , 𝜂𝑛 could be obtained by substituting 𝜆 Β = ∑√𝜌𝑖 𝜌𝑗 H𝑖 Q𝐻
𝑖 R𝑥𝑗 H𝑗 .
𝑖=1
into (30), and then Λ2𝐹 , F, Q1 , and Q2 will be gotten as follows.
The Lagrange multiplier is determined by (36) and (37). It
4.2. Joint Iterative Algorithm Design. When the detection satisfied [26]
matrix Q𝑖 is determined, the optimization problem of (14)
0≤𝜆
can be translated into a convex optimization problem of
relay precoding matrix F. The Lagrangian function of (14) is
formulated as −1 𝜆 1 (vec (Β) vec𝐻 (Β)) 𝜆 1 (R𝑟 ) (40)
≤ Tr [(R𝑟𝑇 ⊗ I𝑛𝑠 ) ] √
𝐿 (F, 𝜆) = min MSE + 𝜆 [Tr (FR𝑟 F𝐻) − 𝑃𝑟 ] . (33) 𝑃𝑟
Q1 ,Q2 ,F

Seeking partial derivative of F∗ and here ⊗ denotes Kronecker product, 𝜆 1 (A) represents the
maximum eigenvalue of the matrix A, and 𝜆 can be obtained
𝜕𝐿 󵄨󵄨󵄨󵄨 2
𝐻 by bisection algorithm with its upper and lower bounds. By
󵄨󵄨 = ∑𝜌𝑖 H𝑖 Q𝐻
𝑖 Q𝑖 H𝑖 FΘ𝑖 (17) and (38), we can see that when the signal matrix x of
𝜕F 󵄨󵄨F=F∗ 𝑖=1
the source node is certain, the relay matrix and the detection
2 matrix are correlated. A joint iterative design algorithm is
+ ∑Tr (Q𝑖 Z𝑖 Q𝐻
𝑖 ) FΩ𝑗 (34) proposed as shown in Algorithm 1.
𝑖=1

2 5. Simulation Results and Analysis

𝐻
− ∑√𝜌𝑖 𝜌𝑗 H𝑖 Q𝐻
𝑖 R𝑥𝑗 H𝑗 + 𝜆FR𝑟 ,
𝑖=1 In this section, simulation results are provided to evaluate the
𝐻 performance of the proposed approaches in a flat Rayleigh
where Ω𝑗 = Π𝑗 + H𝑖 R𝑥𝑖 H𝑖
+ R𝑛𝑟 ; together with the com- fading environment. We consider that the source nodes 𝑆1
plementary slackness and the relay station transmit power and 𝑆2 are equipped with 𝑛𝑠 = 4 antennas. Relay node
constraint, we obtain the KKT conditions as 𝐹 is equipped with 𝑛𝑟 = 4 antennas. The source node
𝜕𝐿 󵄨󵄨󵄨󵄨 transmits independent uncoded QPSK symbol streams to the
󵄨 = 0, (35)
𝜕F 󵄨󵄨󵄨F=F∗ corresponding receiver. The covariance of the transmit signal
at source nodes 𝑆1 and 𝑆2 is R𝑥1 = R𝑥2 = (𝑃𝑠 /𝑛𝑠 )I𝑛𝑠 , and here
𝜆 [Tr (FR𝑟 F𝐻) − 𝑃𝑟 ] = 0, (36) 𝑃𝑠 is the transmit power at each source node; let 𝑃𝑠 = 𝑛𝑠 .
The covariance of the AWGN is satisfied with R𝑛𝑟 = 𝜎𝑟2 I𝑛𝑟
Tr (FR𝑟 F𝐻) ≤ 𝑃𝑟 (37) and R𝑛1 = R𝑛2 = 𝜎𝑠2 I𝑛𝑟 . We investigate the scenarios with
6 Mathematical Problems in Engineering

100 100

fd 𝜏 = 0.05

10 −1
10−1
BER

BER
𝜎Σ2 = 0.02
−2 −2
10 10
fd 𝜏 = 0.01
𝜎Σ2 = 0.005

10−3 10−3
0 5 10 15 20 25 0 5 10 15 20 25
SNR1 /SNR2 (dB) SNR1 /SNR2 (dB)

Amplify-and-forward Matrix decomposition Amplify-and-forward Matrix decomposition

Zero-forcing Joint Iterative optimization Zero-forcing Joint Iterative optimization

Figure 2: BER versus SNR with 𝜎Σ2 = 0.01. Figure 3: BER versus SNR with 𝑓𝑑 𝜏 = 0.05.

various SNR1 = 𝑃𝑠 /(𝑛𝑠 𝜎𝑠2 ) while fixing SNR2 = 𝑃𝑟 /(𝑛𝑟 𝜎𝑟2 ). 100
SNR1 and SNR2 are the average signal-to-noise ratio (SNR)
for the first phase and the second phase of the two-way
communication protocol. The results are averaged over 5000
independent channel realizations, and in each realization
10−1
2000 QPSK symbols are transmitted for each data stream. In
order to verify the superiority of the proposed algorithm, the
BER

proposed methods are compared with the existing methods

as follows:
(i) Amplify-and-forward (AF) relay approach [27] is 10−2 10
−2.01

𝑃𝑟
FAF ∝ √ I . (41)
Tr (R𝑟 ) 𝑛𝑟
10−2.18
22.5 25
10−3
(ii) Zero-forcing (ZF) relay approach [28] is 0 5 10 15 20 25
SNR1 /SNR2 (dB)
2 −1
𝐻
FZF = (∑𝜌𝑖 H𝑖 Q𝐻
𝑖 Q𝑖 H𝑖 Θ𝑖 + 𝜆R𝑟 ) 5 iterations 30 iterations
𝑖=1 20 iterations 40 iterations
(42)
2 Figure 4: BER performance comparisons with different iterations.
𝐻
⋅ (∑√𝜌𝑖 𝜌𝑗 H𝑖 Q𝐻
𝑖 R𝑥𝑗 H𝑗 ) , Q𝑖 ∝ I𝑛𝑟 .
𝑖=1

Figures 2 and 3 are given the performance comparison of
BER while fixing estimated errors 𝜎Σ2 = 𝜎Σ2 1 = 𝜎Σ2 2 and delay
coefficients 𝑓𝑑 𝜏1 = 𝑓𝑑 𝜏2 = 𝑓𝑑 𝜏. Simulation parameters are
as follows: iterations Itermax = 30 and convergence threshold
𝜁 = 10−4 .
Figure 4 is given the performance comparison of BER
with different iteration numbers. Simulation parameters are
as follows: 𝜎Σ2 = 0.002, 𝑓𝑑 𝜏 = 0.02, and convergence threshold
𝜁 = 10−4 .
Figures 5 and 6 are the BER performance comparisons in
the two kinds of SNR while fixing feedback delay coefficient
𝑓𝑑 𝜏 = 0.02 and estimation error variance 𝜎Σ2 = 0.02, respec-
tively. The simulation parameters are as follows: iterations
Itermax = 30 and convergence threshold 𝜁 = 10−4 .
From the above simulations, the following conclusions
can be drawn:
(1) From Figures 2 and 3, the joint iterative algorithm
achieved 3.2 dB and 4 dB performance gain compared
to the ZF scheme and AF scheme while fixing 𝑓𝑑 𝜏 =
0.05, 𝜎Σ2 = 0.005, and BER = 0.05, respectively.
The matrix decomposition algorithm could obtain
2 dB and 3 dB performance gain compared to the ZF
scheme and AF scheme. And it is obvious that matrix
decomposition algorithm could get the optimal sys-
tem BER performance when the channel estimation
error and feedback delay coefficient are certain in
low SNR conditions. As the SNR increases to 10 dB,
the joint iterative algorithm obtains the best BER
Mathematical Problems in Engineering 7

100 the number of iterations. However, this increase is

limited. When the iteration number is more than 30
SNR1 = SNR2 = 10 dB times, BER remains almost constant. By defining the
threshold value of iterations as 30, the joint iterative
method can obtain the best performance.
(3) From Figures 5 and 6, we find that the system BER
BER

10−1 performance has a downward trend with the increase

of the feedback delay coefficient or the channel esti-
mation error; however, the proposed scheme achieves
the best BER performance because it has a certain
SNR1 = SNR2 = 20 dB extent compensated with feedback delay coefficient
and estimation error.
10−2
0 0.005 0.01 0.015 0.02
𝜎Σ2
6. Conclusion
Amplify-and-forward Matrix decomposition This paper investigates a linear precoding scheme design
Zero-forcing Joint Iterative optimization for the MIMO two-way relay system with imperfect CSI.
The transceiver design is simplified as an optimal problem
Figure 5: BER performance comparisons with different 𝜎Σ2 . with precoding matrix variables, which is deduced with the
maximum power constraint at the relay station based on the
100
MMSE criterion. With channel feedback delay at both ends
SNR1 = SNR2 = 10 dB of the channel and the channel estimation errors being taken
into account, a matrix decomposition scheme and a joint
iterative scheme are proposed to minimize the BER. Numer-
ical simulation results show that the matrix decomposition
10−1 scheme can improve the system BER effectively and the joint
iterative scheme can achieve the best BER performance with
BER

the increase of SNR against existing methods.

SNR1 = SNR2 = 20 dB
10−2
Conflicts of Interest
The authors declared that they have no conflicts of interest to
this work. We declare that we do not have any commercial
10−3 or associative interest that represents conflicts of interest in
0 0.01 0.02 0.03 0.04 0.05 0.06 connection with the work submitted.
fd 𝜏

Amplify-and-forward Matrix decomposition Acknowledgments

Zero-forcing Joint Iterative optimization
This work is jointly supported by the Fundamental Research
Figure 6: BER performance comparisons with different 𝑓𝑑 𝜏.
Funds for the Central Universities (no. NS2016044).

performance. Compared to the AF relay approach References

and ZF relay approach, the proposed two schemes
have obvious advantages. Simulation results show
that the proposed algorithm significantly improves
the BER performance compared with the existing
approaches. It is because the used AF relay scheme
only amplifies and forwards the signal, while the
existing ZF scheme ignores the interference signal of
the relay node and performs the weighting processing
on signal only. Moreover, the proposed method not
only considers the channel estimation errors and
feedback delay at each node but also can design
each node matrix jointly. Thus, it can obtain obvious
performance superiority over the other two methods.
(2) As shown in Figure 4, the system BER performance
could be improved by 1-2 dB with the increase of
[1] L. Sanguinetti, A. A. D’Amico, and Y. Rong, “A tutorial on
the optimization of amplify-and-forward MIMO relay systems,”
IEEE Journal on Selected Areas in Communications, vol. 30, no.
8, pp. 1331–1346, 2012.
[2] J. Chen, X. Chen, W. H. Gerstacker, and D. W. K. Ng, “Resource
allocation for a massive MIMO relay aided secure communica-
tion,” IEEE Transactions on Information Forensics and Security,
vol. 11, no. 8, pp. 1700–1711, 2016.
[3] B. Wang, J. Zhang, and A. Host-Madsen, “On the capacity
of MIMO relay channels,” IEEE Transactions on Information
Theory, vol. 51, no. 1, pp. 29–43, 2005.
[4] D. E. Simmons, J. P. Coon, and N. Warsi, “Capacity and power
scaling laws for finite antenna MIMO amplify-and-forward
relay networks,” IEEE Transactions on Information Theory, vol.
62, no. 4, pp. 1993–2008, 2016.
8 Mathematical Problems in Engineering

[5] J. Yang, B. Champagne, Y. Zou, and L. Hanzo, “Joint optimiza- [19] T. R. Ramya and S. Bhashyam, “Using delayed feedback for
tion of transceiver matrices for MIMO-aided multiuser AF relay antenna selection in MIMO systems,” IEEE Transactions on
networks: improving the QoS in the presence of CSI errors,” Wireless Communications, vol. 8, no. 12, pp. 6059–6067, 2009.
IEEE Transactions on Vehicular Technology, vol. 65, no. 3, pp. [20] E. K. S. Au, S. Jin, M. R. McKay, W. H. Mow, X. Gao, and I.
1434–1451, 2016. B. Collings, “Analytical performance of MIMO-SVD systems in
[6] R. Huang, T. Zhang, C. Feng, T. Liang, and F. Li, “Energy effi- ricean fading channels with channel estimation error and feed-
cient power allocation and beamforming in non-regenerative back delay,” IEEE Transactions on Wireless Communications, vol.
two-way MIMO relay networks,” in Proceedings of the Interna- 7, no. 4, pp. 1315–1325, 2008.
tional Symposium on Wireless Personal Multimedia Communi- [21] H. A. Suraweera, T. A. Tsiftsis, G. K. Karagiannidis, and A.
cations (WPMC ’14), pp. 65–69, September 2014. Nallanathan, “Effect of feedback delay on amplify-and-forward
[7] B. Fang, Z. Qian, W. Zhong, and W. Shao, “Joint design relay networks with beamforming,” IEEE Transactions on Vehic-
for source and relay precoding in AF-based MIMO two-way ular Technology, vol. 60, no. 3, pp. 1265–1271, 2011.
relay networks,” in Proceedings of the IEEE China Summit and [22] C. Xing, Y. Ma, Y. Zhou, and F. Gao, “Transceiver optimization
International Conference on Signal and Information Processing for multi-hop communications with per-antenna power con-
(ChinaSIP ’15), pp. 953–957, IEEE, Chengdu, China, July 2015. straints,” IEEE Transactions on Signal Processing, vol. 64, no. 6,
[8] R. Wang and M. Tao, “Joint source and relay precoding designs pp. 1519–1534, 2016.
for MIMO two-way relaying based on MSE criterion,” IEEE [23] C. Xing, Y. Jing, and Y. Zhou, “On weighted MSE model for
Transactions on Signal Processing, vol. 60, no. 3, pp. 1352–1365, MIMO transceiver optimization,” IEEE Transactions on Vehicu-
2012. lar Technology, 2017.
[9] D. Hwang, S. S. Nam, T.-J. Lee, and D. I. Kim, “Finite feedback [24] S. Xu and Y. Hua, “Optimal design of spatial source-and-relay
MIMO precoding for the two-way amplify-and-forward relay matrices for a non-regenerative two-way MIMO relay system,”
network,” IEEE Communications Letters, vol. 18, no. 4, pp. 620– IEEE Transactions on Wireless Communications, vol. 10, no. 5,
623, 2014. pp. 1645–1655, 2011.
[10] W.-C. Choi, S. Choi, A. Heo, and D.-J. Park, “Joint optimization [25] C. Zhao and B. Champagne, “A unified approach to optimal
of source and relay for MIMO two-way relay networks using transceiver design for nonregenerative MIMO relaying,” IEEE
MSE duality,” IEEE Communications Letters, vol. 18, no. 7, pp. Transactions on Vehicular Technology, vol. 64, no. 7, pp. 2938–
1246–1249, 2014. 2951, 2015.
[11] L. Shen, Y. Fu, C. Liu, and W.-P. Zhu, “Joint relay and destination [26] C. Xing, S. Li, Z. Fei, and J. Kuan, “How to understand linear
design for two-way MIMO AF multi-relay systems,” in Proceed- minimum mean-square-error transceiver design for multiple-
ings of the IEEE 78th Vehicular Technology Conference (VTC Fall input-multipleoutput systems from quadratic matrix program-
’13), pp. 1–5, September 2013. ming,” IET Communications, vol. 7, no. 12, pp. 1231–1242, 2013.
[12] E. A. Gharavol and E. G. Larsson, “Robust joint optimization [27] C. Song and C. Ling, “On the diversity of linear transceivers in
of MIMO two-way relay channels with imperfect CSI,” in MIMO AF relaying systems,” IEEE Transactions on Information
Proceedings of the 49th Annual Allerton Conference on IEEE Theory, vol. 62, no. 1, pp. 272–289, 2016.
Communication, Control, and Computing, pp. 1657–1664, 2011.
[28] C. Zhai, X. Li, and Y. Hei, “Joint linear transceiver design
[13] K. X. Nguyen, Y. Rong, and S. Nordholm, “Simplified MMSE
for uplink multiuser non-regenerative MIMO relay systems,”
precoding design in interference two-way MIMO relay sys-
in Proceedings of the 7th International Conference on Wireless
tems,” IEEE Signal Processing Letters, vol. 23, no. 2, pp. 262–266,
Communications, Networking and Mobile Computing (WiCOM
2016.
’11), pp. 1–4, September 2011.
[14] M. Ding and S. D. Blostein, “MIMO minimum total MSE
transceiver design with imperfect CSI at both ends,” IEEE
Transactions on Signal Processing, vol. 57, no. 3, pp. 1141–1150,
2009.
[15] M. A. Hanif and M. H. Lee, “Sum-rate analysis of two-way
multi-relay multi-user MIMO networks with two-hop pre-
coding,” in Proceedings of the 6th International Conference
on Information and Communication Technology Convergence
(ICTC ’15), pp. 891–893, October 2015.
[16] E. A. Gharavol and E. G. Larsson, “Robust joint optimization of
MIMO two-way relay channels with imperfect CSI,” in Proceed-
ings of the 49th Annual Allerton Conference on Communication,
Control, and Computing (Allerton ’11), pp. 1657–1664, IEEE,
September 2011.
[17] Y. Rong, M. R. A. Khandaker, and Y. Xiang, “Channel esti-
mation of dual-hop MIMO relay system via parallel factor
analysis,” IEEE Transactions on Wireless Communications, vol.
11, no. 6, pp. 2224–2233, 2012.
[18] T. M. C. Chu, T. Q. Duong, and H.-J. Zepernick, “Outage prob-
ability and ergodic capacity for MIMO-MRT systems under
co-channel interference and imperfect CSI,” in Proceedings of
the IEEE Swedish Communication Technologies Workshop (Swe-
CTW ’11), pp. 46–51, October 2011.
Advances in Advances in Journal of Journal of
Operations Research
Hindawi Publishing Corporation
Decision Sciences
Hindawi Publishing Corporation
Applied Mathematics
Hindawi Publishing Corporation
Algebra
Hindawi Publishing Corporation
Probability and Statistics
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

The Scientific International Journal of

World Journal
Hindawi Publishing Corporation
Differential Equations
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

Submit your manuscripts at

https://www.hindawi.com

International Journal of Advances in

Combinatorics
Hindawi Publishing Corporation
Mathematical Physics
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

Journal of Journal of Mathematical Problems Abstract and Discrete Dynamics in

Complex Analysis
Hindawi Publishing Corporation
Mathematics
Hindawi Publishing Corporation
in Engineering
Hindawi Publishing Corporation
Applied Analysis
Hindawi Publishing Corporation
Nature and Society
Hindawi Publishing Corporation
http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014

International
Journal of Journal of
Mathematics and
Mathematical
#HRBQDSDĮ,@SGDL@SHBR
Sciences

Journal of International Journal of Journal of

Hindawi Publishing Corporation Hindawi Publishing Corporation Volume 2014

http://www.hindawi.com
Function Spaces
Hindawi Publishing Corporation
Volume 201 http://www.hindawi.com http://www.hindawi.com
Stochastic Analysis
Hindawi Publishing Corporation
Optimization
Hindawi Publishing Corporation
Volume 2014 http://www.hindawi.com Volume 2014 http://www.hindawi.com Volume 2014