# A Low-Complexity Block Diagonalization Algorithm for MU-MIMO Two-Way Relay Systems with Complex Lattice Reduction

Authors: Lin Xiao; Shengen Liu; Dingcheng Yang
Journal: International Journal of Distributed Sensor Networks
 (2015)

---

## Abstract

We design a scheme of precoding matrices for two-way multiuser relay systems, where a multiantenna relay station (RS) operating in an amplify-and-forward model simultaneously receives information from all multiple-antenna users. Considering the feasibility in mathematical analysis, users are distributed in two symmetrical groups. To reduce the complexity of proposed precoding scheme, we employ the QR decomposition and complex lattice reduction (CLR) transform to replace the two times singular value decomposition (SVD) of conventional BD-based precoding algorithm by introducing a combined channel inversion to eliminate the multiple users interference (MUI). Simulation and performance analysis demonstrate that the proposed LR-MMSE algorithm has not only a better bit error rate (BER) performance, a higher sum-rate, and simple architecture, but also 89.8% and 35.5% less complexity compared to BD- and MMSE-based scheme.


---

## Body

## 1. Introduction

Two-way relaying (TWR) cooperation has attracted considerable attention due to the high spectral efficiency. A typical model of the TWR protocol with multiple access channel (MAC) phase and broadcast channel (BC) phase has been investigated in [1]. In the MAC phase, two source nodes transmit their message to the relay node simultaneously. After processing the mixed received signal at the relay, a combined version of the received signal is broadcast to each source node in the BC phase.Among the numerous two-way relaying protocols, such as amplify-and-forward (AF) and decode-and forward [2], AF protocol gets favored as one or more low-complexity relay nodes are adopted to assist the communication between sources and destinations without decoding the signals.In wireless sensor networks (WSNs), a large number of static or mobile sensors cooperate to perceive, compute, and transmit message assistant by the relay [3]. Since sensor nodes are usually operated by lightweight batteries that are difficult to replace or recharge, energy becomes one of the most crucial resources in WSNs. Moreover, experimental measurements have shown that the energy consumption of a sensor node is dominated by communications [4]. Thus, a simple and low-complexity transceiver model for sensors is a powerful solution to solve this problem. Recently, a prominent research in [5] has proposed a multilevel physical layer network coding to rule the rate of sensors, which saves the power of networks potentially.As we known, multiple-input multiple-output (MIMO) relays potentially obtain both spectral efficiency and link reliability by exploiting the multiple antennas, and, jointing the TWR technology, it can improve the system performance dramatically. Recently, the precoding design for TWR MIMO systems is extended to multiuser cases, which can be roughly divided into two categories: symmetric systems and asymmetric systems [6–11]. In symmetric system, all users are supposed to be distributed in two groups in the form of pairings [6–8]. In asymmetric systems, a based station exchanges messages with multiple users [9–11], which is a typical scenario of cellular networks.Unlike the received signals in single-user MIMO (SU-MIMO) systems, the received signals of different users in multiuser MIMO (MU-MIMO) systems not only suffer from the noise and intra-antenna interference but are also disturbed by the multiuser interference (MUI). However, when we consider two-way relaying multiuser MIMO (TWR MU-MIMO) systems, the MUI becomes more complicated, since there are two groups of users mixing in the received signals.Channel inversion strategies based on zero forcing (ZF) and minimum mean squared error (MMSE) can be used to cancel the MUI but result in amplifying the noise [12, 13]. Block diagonalization (BD) has been proposed in [14, 15] to improve the system throughput and provide convenience for the power control. Literature [16] studies the precoding scheme of the singular value decomposition (SVD) and employs a technology of channels aligning referring to [17]. However, the complexity of SVD is very high when the number of users and the specification of the antenna are large. In order to reduce the complexity, generalized singular value decomposition (GSVD) has been applied in [18] to design the downlink of MIMO systems. Unfortunately, there is also a great performance loss at low signal to noise ratios (SNRs) when the noise is the dominant factor. In recent research, a systematic scheme is proposed in [7], which imposes a power constraint at the relay node and obtains an approximate result by fixing the transmitting and receiving matrices at the user nodes firstly. In [19], a low complexity precoding algorithm is proposed to reduce the condition number of the effective number by introducing a complex lattice reduction (CLR) transform in one-way relay MU-MIMO systems.In this paper, we focus on AF TWR MU-MIMO systems and strive to find a lower complexity and better performance precoding scheme. By employing a combined channel inversion and replacing the SVD with QR decomposition, we can cancel the MUI remarkably. Then, the CLR transform is used to design the precoding matrices of users which locate in another group and is in pairs of receiving users.The rest of the paper is organized as follows. Section2 describes the conventional system model. Section 3 introduces the BD-based precoding algorithm. The scheme LR-MMSE is proposed in Section 4. Performance analysis and simulation are given in Sections 5 and 6. Finally, we conclude this work in Section 7.Notation. Throughout this paper, for a matrix A, TrA, AT, AH, A-1, and A† denote the trace, transpose, complex conjugate transpose, inverse, and pseudoinverse, respectively. “E” stands for the expectation of a random variable; the terms Ca×b represent the a×b-dimensional space with complex-valued elements. The notations AF and AF2 denote Frobenius-norm and 2-norm of matrix A. Im×n is a m-by-n identity matrix; 0m is a m-dimensional zero matrix.


## 2. General System Model

Investigate an uncoded TWR MU-MIMO system, withK pairs of user equipment (UE) and one two-way relay station (RS) which operates in AF protocol. For simplicity, we consider a symmetric model in which users are divided into two groups: l∈a,b. The kth user in group l and the relay has equipped Nl,k and NR antennas, respectively. A block diagram of such a system is shown in Figure 1.Figure 1
System model.Ruled that there is no direct link between two users and all the channels experience independent and flat MIMO fading. Letdl,kt denote the data symbol at time t for the kth user in group l (UEl,k). The UEl,k performs transmit precoding beamforming with vector Pl,k∈CNR×Nl,k and transmits the signal in the following form of matrix:(1)xl,kt=Pl,kdl,kt∈CNl,k×1,where dl,kt∈CNl,k×1 and satisfies Edl,ktdl,kHt=ξnl,k2·INl,k. We assume the average power of the transmit signal is 1.Then, usersUEa and UEb exchange their signals by the assisted relay node RS in two phases. Firstly, in the multiple access channel (MAC) phase, UEa and UEb transmit their signals simultaneously to relay and the received signals at RS are given by(2)rt=∑k=1KHa,kxa,kt+∑k=1KHb,kxb,kt+nst,where Hl,k∈CNR×Nl,k is the channel coefficient coming from UEl,k to RS and nst∈CNR×1 is a zero-mean addictive white Gaussian noise (AWGN) at the relay and EnstnsHt=σns2INR.In the broadcast (the broadcast channel) phase, the RS forwards and broadcasts the mixed signalsst∈CNR×1 to all user by multiplying a forward matrix f∈CNR×NR, where(3)st=frt.It is worth noting that the f is an assistant precoding matrix for decoding the signals at receiver sites. Since it is supposed that channel reciprocity (This assumption is reasonable when we consider time division duplex (TDD) systems. Channels in uplink and downlink are static and identical in the frequency domain.) is met within two phases, the received signals yl,kt∈CNl,k×1 at the user UEl,k side are(4)yl,kt=Hl,kTst+nl,kt,where nl,kt∈CNl,k×1 is also a zero-mean AWGN at the UEl,k and Enl,ktnl,kHt=σ2INl,k. The UEl,k combines its own received signal (4) by using a received decoding vector gl,k∈C1×Nl,k to get the estimate(5)d^l^,kt=gl,kyl,kt,where d^l^,kt denotes the information coming from UEl^,k, the subscripts l and l^∈a,b, and l≠l^ represents the user pairings. For notational convenience, the time index t is henceforth wiped off. Refer to Figure 2(a), which shows the overall procedure for transmit- and receive-beamforming and relaying of multiuser two-way systems. Next, designs of the scheme of precoding matrices are given with the criteria of BD, ZF, and MMSE. Further, the lattice reduction is applied to suppress the bit error rate (BER) of the system. As a result, we can omit the decoding matrix to obtain a simple structure.Figure 2
(a) The transfer model for conventional precoding algorithms. (b) The transfer model for the proposed LR-MMSE algorithm.
(a)
(b)


## 3. Generalized Design of BD-Based Precoding Algorithm

The BD- and SVD-based precoding algorithms are proposed in [10] and [12], respectively. Combining the two ideas, the BD-based scheme can be given as follows.The received signals at the usersUEl,k and UEl^,k sides can be written as(6)d^l^,k=gl,kyl,k.The detail components of d^l^,k are (7)d^l^,k=gl,kHl,kTfl,kHl,kdl,k︸1+gl,kHl,kTfl,k∑i=1,i≠kKHl,idl,i︸2+gl,kHl,kTfl,k∑i=1,i≠kKHl^,idl^,i︸3+gl,kHl,kTfl,kHl^,kdl^,k︸4+gl,kHl,kTfl^,kns+gl,knl,k.The 1st item can be dismissed by the perfect self-interference suppression, and the key in the rest of processing is to eliminate MUI and obtain a good performance of the signal estimation.Based on the system model, the combined channel matrix is given byH=[Hl,1⋯Hl,K,Hl^,1⋯Hl^,K]∈CNR×N, where N denotes the sum of users’ antennas. We define H¯l,k=[Hl,1Hl,k-1Hl,k+1⋯Hl,K,Hl^,1⋯Hl^,K] so that H¯l,k∈CNR×N¯l,k, where N¯l,k=N-Nl,k. In order to eliminate the MUI in (7), we impose the BD constraint in which(8)H¯l^,kfl^,k=0∀k∈1,…,K.Firstly, by employing the SVD to H¯l^,k,(9)H¯l^,k=U¯l^,kΛ-l^,kV¯l^,kH=U¯l^,kΛ-l^,kV¯l^,k1V¯l^,k0H,where U¯l,k∈CNR×NR and V¯l^,kH∈CN¯l^,k×N¯l^,k are unitary matrices. The diagonal matrix Σ¯l,k∈CNR×N¯l,k is composed of the singular values of H¯l^,k. Factorizing V¯l^,k into two parts, V¯l^,k(1)∈CNR×λl^,k consists of the first Ll^,k none-zero singular column vectors and V¯l^,k(0)∈CNR×NR-Ll^,k holds the last NR-Ll^,k zero singular column vectors, where Ll^,k is rankV¯l^,k. Thus, V¯l^,k(0) lies in the null space of H¯l^,k. The relay forward matrix fl^,k can be obtained as(10)fl^,k=V¯l^,k0.Substituting (10) into (7), we have the effective channel(11)Hl^,keff=Hl,kTfl^,kHl^,k=Hl,kTV¯l^,k0Hl^,k.Then, the second SVD operation is used to obtain the precoding and decoding matrix. We have(12)Hl^,keff=Ul^,kΛl^,k000Vl^,kH.Finally, the user UEl^,k’s precoding matrix Pl^,k=Vl^,kΩl^,k and the decoding matrix is obtained as gl,k=Ul^,kH, where Ωl^,k is a diagonal matrix and its elements stand for the transmit power allocation. To guarantee that the V¯l^,k(0) is not a null matrix, we must have N>NR. Note that we omit the dimension matching matrices in (11) which will be mentioned in the next section.


## 4. The Proposed LR-MMSE Precoding Algorithms

In this section, we describe the proposed precoding algorithms based on a strategy that employs a combined channel inversion method, QR decompositions, and lattice reductions in detail. We can solve the questions with ZF and MMSE criteria. For a better BER performance, the complex lattice reduction is proposed to improve the MMSE performance.


### 4.1. ZF-Based Design

The ZF-based design of precoding matrix termed as ZF can be performed in two steps.Step 1.
It is to obtain the relay forward matrixfl,k,zf which eliminates the MUI completely by a QR decomposition of H¯l^,k.Firstly, by using the ZF inversion to the combined channel matrixH, we have(13)Hzf†=HHHHH-1=Hl,1,zfHl,2,zf⋮Hl^,K,zf,where Hzf† is the pseudoinverse of matrix Hzf and Hl^,k,zf∈CNl^,k×NR is the submatrix of Hzf†. Note that HzfHzf†=INR [12]. Thus, the off-diagonal block matrices of HHzf† are zero and Hl^,k,zf is in the null space of H¯l^,k; that is,(14)Hl^,k,zfH¯l^,k=0.Imposing the QR decomposition onHl^,k,zf=Ql^,k,zfRl^,k,zf, we have(15)Ql^,k,zfH¯l^,k=0,∀k∈1,…,K,where Ql^,k,zf∈CNl^,k×NR is an orthogonal matrix. Then, substituting fl^,k1 into (7), the 2nd and 3rd items will be equal to zeros.Step 2.
It is to obtain the user precoding and receive decoding matricespl^,k,zf and gl,k,zf by a SVD of the effective channel.Note that the degree of freedom betweenHl,kT and Hl^,k is NR×NR, we match the dimensions with the help of Πl^,k∈CNR×Nl^,k, and Πl^,kF2=1. Then, substituting fl^,k1 and Πl^,k into the 4th item of d^l^,k, we have the effective channel (16)Hl^,k,zfeff=Hl,kTΠl^,kQl^,k,zfHl^,k,where Hl^,k,zfeff∈CNl,k×Nl^,k. The ZF algorithm can be completed by applying the SVD operation to the matrix Hl^,k,zfeff=Ul^,k,zfΛl^,k,zfVl^,k,zfH. Then, the user precoding and receive decoding matrices pl^,k,zf and gl,k,zf are designed by pl^,k,zf=Vl^,k,zfΩl^,k and gl,k,zf=Ul^,k,zfH, respectively. (pl^,k,zf denotes the precoding processing at the site of UEl^,k and gl,k,zf denotes the receiving processing at the site of UEl,k. This type of subscript contributes to distinguishing the two matrices.) Finally, we get the systematic ZF precoding scheme for users.


### 4.2. MMSE-Based Design

Similar to Section4.1, the MMSE-based design of precoding matrix termed as MMSE is performed by introducing the MMSE inversion to the combined channel matrix; we have(17)Hmmse†=HHHHH+αI-1=Hl,1,mseHl,2,mse⋮Hl^,K,mse,where Hl^,k,mmse∈CNl^,k×NR is the submatrix of pseudoinverse matrix Hmmse† and α=Nσ. Note that the regularization factor α approaches zero when the SNR is high, and thus we have HHmmse†≈INR [12]. This means that those off-diagonal block matrices of HHmmse† converge to zeros with the increase in SNR. Hence, the matrix Hl^,k,mmse is approximately in the null space of H¯l^,k; that is,(18)Hl^,k,mmseH¯l^,k≈0.Through the QR decomposition of Hl^,k,mmse=Ql^,k,mmseRl^,k,mmse, where Ql^,k,mmse∈CNl^,k×NR is also an orthogonal matrix and Rl^,k,mmse is an upper triangular matrix, we have(19)Hl^,k,mmseH¯l^,k=Ql^,k,mmseRl^,k,mmseH¯l^,k≈0.Since Rl^,k,mmse is invertible, we have(20)Ql^,k,mmseH¯l^,k≈0.So the relay forward matrix for UEl^,k is designed as(21)fl^,k,mmse=Ql^,k,mmse.By the above process and matching matrix Πl^,k=INl,k×Nl^,k, the received signals d^l^,k can be rewritten as(22)d^l^,k=gl,kHl,kTΠl^,kQl^,k,mmseHl^,kdl^,k+gl,kHl,kTΠl^,kQl^,k,mmsens+gl,knl,k.Then, the MMSE-BD algorithm also can be completed by applying the SVD operation to the effective channel matrix(23)Hl^,k,mmseeff=Hl^,kTΠl^,kQl^,k,mmseHl^,k=Ul^,k,mmseΛl^,k,mmseVl^,k,mmseH.The user precoding and receive decoding beamforming matrices of MMSE are obtained as (24)Pl^,k,mmse=Vl^,k,mmseΩl^,k,gl,k,mmse=Ul^,k,mmseH.Finally, the systematic MMSE precoding schemes for all users are followed as(25)P=diagPl,1,mmse⋯Pl,K,mmse,Pl^,k,mmse⋯Pl^,K,mmse,F=diagFl,1,mmse⋯Fl,K,mmse,Fl^,k,mmse⋯Fl^,K,mmse,G=diaggl,1⋯gl,K,gl^,k⋯gl^,K.The MMSE algorithm is summarized in Algorithm 1.Algorithm 1:The MMSE precoding algorithm.
Steps and their operations
Applying the MMSE Channel Inversion
(
1
)  Hmmse†=HH(HHH+αI)-1
(
2
) for k = 1 : K
(
3
) [Ql^,k,mmseRl^,k,mmse]=QR(Hl^,k,mmse,0)
(
4
) fl^,k,mmse1=Ql^,k,mmse
(
5
) Hl^,k,mmseeff=Hl^,kTΠl^,kQl^,k,mmseHl^,k=Ul^,k,mmseΛl^,k,mmseVl^,k,mmseH
(
6
) fl^,k,mmse=Ql^,k,mmse
(
7
) gl,k=Ul^,k,mmseH, Pl^,k,mmse=Vl^,k,mmse
(
8
) end
Operate similar circulation to obtainfl,k,mmse,Pl,k,mmse  andgl^,kthen Compute overall precoding scheme
(
9
)  F=diag⁡{Fl,1,mmse⋯Fl,K,mmse,Fl^,k,mmse⋯Fl^,K,mmse}
(
10
)  G=diag⁡{gl,1⋯gl,K,gl^,k⋯gl^,K},  P=diag⁡{Pl,1,mmse⋯Pl,K,mmse,Pl^,k,mmse⋯Pl^,K,mmse}
(
13)  d^l^,k=gl,kdl^,k+gl,knl^,keff


### 4.3. LR-MMSE-Based Design

In this subsection, LR is applied to reduce the dimension of the effective channel which replaces SVD in MMSE algorithm. For convenience, we term it as LR-MMSE (see Figure2(b)). A powerful and famous reduction criterion for arbitrary lattice dimensions was introduced by Lenstra et al. in [20], and the algorithm they proposed is known as the LLL (or L3) algorithm [21, 22]. In order to reduce the complexity, a complex LLL (CLLL) algorithm was in [23], which reduces the overall complexity of the LLL algorithm by nearly half without sacrificing any performance. Through reducing the size of channels, CLLL can obtain better BER performance. In this paper, we employ the CLLL algorithm to implement the LR transform.After the first MMSE precoding, we transform the MU-MIMO channel into parallel or approximately parallel SU-MIMO channels and the effective channel matrix for theUEl,k is(26)Hl^,k,mmseeff=Hl,kTΠl^,kQl^,k,mmseHl^,k.We perform the LR transformation on Hl^,k,mmseeff in the precoding scenario [24]; that is,(27)H~l^,k,mmseeff=Tl^,kHl^,k,mmseeff,Hl^,k,mmseeff=Tl^,k-1H~l^,k,mmseeff,where Tl^,k is a unimodular matrix with det⁡|Tl^,k|=1 and all elements of Tl^,k are complex integers. The unimodular feature of Tl^,k guarantees that the energy will not change through the LR transform.The MMSE precoding is actually equivalent to the ZF precoding with respect to an extended system model [25]. The extended channel matrix H_ for the MMSE precoding scheme is defined as(28)H_=HηIN.By introducing the MMSE method, a trade-off between the level of MUI and the noise is introduced (see also [12]). Then, the LR-M-D precoding filter is designed as(29)Fmse=ηH_HH_H_H-1,where η=[IN,0N×NR] and the multiplication by η will not result in transmit power amplifying since ησH=IN. From the mathematical expression in (15), the rows of H determine the effective transmit power amplification of the MMSE precoding. Correspondingly, the LR transformation for the MMSE precoding can be applied to the transpose of the extended channel matrix H_l^,k,mmseeff=[Hl^,k,mmseeff,ηINl,k], and the LR transformed channel matrix H~_l^,k,mmseeff is obtained as(30)H~_l^,k,LReff=T_l^,kH_l^,k,mmseeff,where T_l^,k is the unimodular matrix for H_l^,k,mmseeff. Then, the LR-MMSE relay forwarding filter is given by(31)Pl^,k,LR=ηl^,kH~_l^,k,LReffHH~_l^,k,LReffH~_l^,k,LReffH-1Ωl^,k,where the matrix ηl^,k=IMl^,k0(Nl^,k-Ml^,k)×Ml^,k and Ml^,k is the dimension of H~_l^,k,LReff. Since LR transformation can reduce the matrix dimension, there should be Nl^,k>Ml^,k. Finally, the systematic MMSE precoding scheme for all users is followed as (32)P=diagPl,1,LR⋯Pl,K,LR,Pl^,k,LR⋯Pl^,K,LR,F=diagfl,1,mmse⋯fl,K,mmse,fl^,k,mmse⋯fl^,K,mmse.Since the lattice reduced precoding matrixP has near orthogonal columns, the required transmit power will be reduced compared to the MMSE precoding algorithms. Thus, a better BER performance than that of the BD precoding algorithms can be achieved by the proposed LR-MMSE precoding algorithm. The left work for receiver is to quantize the signals d^ to the nearest vectors. The LR-MMSE algorithm is summarized in Algorithm 2.Algorithm 2:The LR-MMSE precoding algorithm.
Steps and their operations
Applying the MMSE Channel Inversion
(
1
)  Hmmse†=HH(HHH+αI)-1
(
2
)  for k = 1 : K
(
3
) [Ql^,k,mmseRl^,k,mmse]=QR(Hl^,k,mmse,0)
(
4
) fl^,k,mmse=Ql^,k,mmse
(
5
) Hl^,k,mmseeff=Hl^,kTΠl^,kQl^,k,mmseHl^,k=Ul^,k,mmseΛl^,k,mmseVl^,k,mmseH
(
6
) H_l^,k,mmseeff=[Hl^,k,mmseeff,σINl,k]
(
7
) [T_l^,k,H_l^,k,LReff]=CLLL(H_l^,k,mmseeff)
(
8
) ηl^,k=[IMl^,k0(Nl^,k-Ml^,k)×Ml^,k]
(
9
)  Pl^,k,LR=ηl^,k(H_l^,k,LReff)H[H_l^,k,LReff(H_l^,k,LReff)H]-1
(
10
)  end
Operate similar circulation to obtainfl,k,mmseandPl,k,mmsethen Compute overall precoding scheme
(
10
)  F=diag⁡{Fl,1,mmse⋯Fl,K,mmse,Fl^,k,mmse⋯Fl^,K,mmse}
(
11
)  P=diag⁡{Pl,1,LR⋯Pl,K,LR,Pl^,k,LR⋯Pl^,K,LR}
(
14
)  d^l^,k=Tl^,k-1dl^,k+ηl^,knl^,keff


## 4.1. ZF-Based Design

The ZF-based design of precoding matrix termed as ZF can be performed in two steps.Step 1.
It is to obtain the relay forward matrixfl,k,zf which eliminates the MUI completely by a QR decomposition of H¯l^,k.Firstly, by using the ZF inversion to the combined channel matrixH, we have(13)Hzf†=HHHHH-1=Hl,1,zfHl,2,zf⋮Hl^,K,zf,where Hzf† is the pseudoinverse of matrix Hzf and Hl^,k,zf∈CNl^,k×NR is the submatrix of Hzf†. Note that HzfHzf†=INR [12]. Thus, the off-diagonal block matrices of HHzf† are zero and Hl^,k,zf is in the null space of H¯l^,k; that is,(14)Hl^,k,zfH¯l^,k=0.Imposing the QR decomposition onHl^,k,zf=Ql^,k,zfRl^,k,zf, we have(15)Ql^,k,zfH¯l^,k=0,∀k∈1,…,K,where Ql^,k,zf∈CNl^,k×NR is an orthogonal matrix. Then, substituting fl^,k1 into (7), the 2nd and 3rd items will be equal to zeros.Step 2.
It is to obtain the user precoding and receive decoding matricespl^,k,zf and gl,k,zf by a SVD of the effective channel.Note that the degree of freedom betweenHl,kT and Hl^,k is NR×NR, we match the dimensions with the help of Πl^,k∈CNR×Nl^,k, and Πl^,kF2=1. Then, substituting fl^,k1 and Πl^,k into the 4th item of d^l^,k, we have the effective channel (16)Hl^,k,zfeff=Hl,kTΠl^,kQl^,k,zfHl^,k,where Hl^,k,zfeff∈CNl,k×Nl^,k. The ZF algorithm can be completed by applying the SVD operation to the matrix Hl^,k,zfeff=Ul^,k,zfΛl^,k,zfVl^,k,zfH. Then, the user precoding and receive decoding matrices pl^,k,zf and gl,k,zf are designed by pl^,k,zf=Vl^,k,zfΩl^,k and gl,k,zf=Ul^,k,zfH, respectively. (pl^,k,zf denotes the precoding processing at the site of UEl^,k and gl,k,zf denotes the receiving processing at the site of UEl,k. This type of subscript contributes to distinguishing the two matrices.) Finally, we get the systematic ZF precoding scheme for users.


## 4.2. MMSE-Based Design

Similar to Section4.1, the MMSE-based design of precoding matrix termed as MMSE is performed by introducing the MMSE inversion to the combined channel matrix; we have(17)Hmmse†=HHHHH+αI-1=Hl,1,mseHl,2,mse⋮Hl^,K,mse,where Hl^,k,mmse∈CNl^,k×NR is the submatrix of pseudoinverse matrix Hmmse† and α=Nσ. Note that the regularization factor α approaches zero when the SNR is high, and thus we have HHmmse†≈INR [12]. This means that those off-diagonal block matrices of HHmmse† converge to zeros with the increase in SNR. Hence, the matrix Hl^,k,mmse is approximately in the null space of H¯l^,k; that is,(18)Hl^,k,mmseH¯l^,k≈0.Through the QR decomposition of Hl^,k,mmse=Ql^,k,mmseRl^,k,mmse, where Ql^,k,mmse∈CNl^,k×NR is also an orthogonal matrix and Rl^,k,mmse is an upper triangular matrix, we have(19)Hl^,k,mmseH¯l^,k=Ql^,k,mmseRl^,k,mmseH¯l^,k≈0.Since Rl^,k,mmse is invertible, we have(20)Ql^,k,mmseH¯l^,k≈0.So the relay forward matrix for UEl^,k is designed as(21)fl^,k,mmse=Ql^,k,mmse.By the above process and matching matrix Πl^,k=INl,k×Nl^,k, the received signals d^l^,k can be rewritten as(22)d^l^,k=gl,kHl,kTΠl^,kQl^,k,mmseHl^,kdl^,k+gl,kHl,kTΠl^,kQl^,k,mmsens+gl,knl,k.Then, the MMSE-BD algorithm also can be completed by applying the SVD operation to the effective channel matrix(23)Hl^,k,mmseeff=Hl^,kTΠl^,kQl^,k,mmseHl^,k=Ul^,k,mmseΛl^,k,mmseVl^,k,mmseH.The user precoding and receive decoding beamforming matrices of MMSE are obtained as (24)Pl^,k,mmse=Vl^,k,mmseΩl^,k,gl,k,mmse=Ul^,k,mmseH.Finally, the systematic MMSE precoding schemes for all users are followed as(25)P=diagPl,1,mmse⋯Pl,K,mmse,Pl^,k,mmse⋯Pl^,K,mmse,F=diagFl,1,mmse⋯Fl,K,mmse,Fl^,k,mmse⋯Fl^,K,mmse,G=diaggl,1⋯gl,K,gl^,k⋯gl^,K.The MMSE algorithm is summarized in Algorithm 1.Algorithm 1:The MMSE precoding algorithm.
Steps and their operations
Applying the MMSE Channel Inversion
(
1
)  Hmmse†=HH(HHH+αI)-1
(
2
) for k = 1 : K
(
3
) [Ql^,k,mmseRl^,k,mmse]=QR(Hl^,k,mmse,0)
(
4
) fl^,k,mmse1=Ql^,k,mmse
(
5
) Hl^,k,mmseeff=Hl^,kTΠl^,kQl^,k,mmseHl^,k=Ul^,k,mmseΛl^,k,mmseVl^,k,mmseH
(
6
) fl^,k,mmse=Ql^,k,mmse
(
7
) gl,k=Ul^,k,mmseH, Pl^,k,mmse=Vl^,k,mmse
(
8
) end
Operate similar circulation to obtainfl,k,mmse,Pl,k,mmse  andgl^,kthen Compute overall precoding scheme
(
9
)  F=diag⁡{Fl,1,mmse⋯Fl,K,mmse,Fl^,k,mmse⋯Fl^,K,mmse}
(
10
)  G=diag⁡{gl,1⋯gl,K,gl^,k⋯gl^,K},  P=diag⁡{Pl,1,mmse⋯Pl,K,mmse,Pl^,k,mmse⋯Pl^,K,mmse}
(
13)  d^l^,k=gl,kdl^,k+gl,knl^,keff


## 4.3. LR-MMSE-Based Design

In this subsection, LR is applied to reduce the dimension of the effective channel which replaces SVD in MMSE algorithm. For convenience, we term it as LR-MMSE (see Figure2(b)). A powerful and famous reduction criterion for arbitrary lattice dimensions was introduced by Lenstra et al. in [20], and the algorithm they proposed is known as the LLL (or L3) algorithm [21, 22]. In order to reduce the complexity, a complex LLL (CLLL) algorithm was in [23], which reduces the overall complexity of the LLL algorithm by nearly half without sacrificing any performance. Through reducing the size of channels, CLLL can obtain better BER performance. In this paper, we employ the CLLL algorithm to implement the LR transform.After the first MMSE precoding, we transform the MU-MIMO channel into parallel or approximately parallel SU-MIMO channels and the effective channel matrix for theUEl,k is(26)Hl^,k,mmseeff=Hl,kTΠl^,kQl^,k,mmseHl^,k.We perform the LR transformation on Hl^,k,mmseeff in the precoding scenario [24]; that is,(27)H~l^,k,mmseeff=Tl^,kHl^,k,mmseeff,Hl^,k,mmseeff=Tl^,k-1H~l^,k,mmseeff,where Tl^,k is a unimodular matrix with det⁡|Tl^,k|=1 and all elements of Tl^,k are complex integers. The unimodular feature of Tl^,k guarantees that the energy will not change through the LR transform.The MMSE precoding is actually equivalent to the ZF precoding with respect to an extended system model [25]. The extended channel matrix H_ for the MMSE precoding scheme is defined as(28)H_=HηIN.By introducing the MMSE method, a trade-off between the level of MUI and the noise is introduced (see also [12]). Then, the LR-M-D precoding filter is designed as(29)Fmse=ηH_HH_H_H-1,where η=[IN,0N×NR] and the multiplication by η will not result in transmit power amplifying since ησH=IN. From the mathematical expression in (15), the rows of H determine the effective transmit power amplification of the MMSE precoding. Correspondingly, the LR transformation for the MMSE precoding can be applied to the transpose of the extended channel matrix H_l^,k,mmseeff=[Hl^,k,mmseeff,ηINl,k], and the LR transformed channel matrix H~_l^,k,mmseeff is obtained as(30)H~_l^,k,LReff=T_l^,kH_l^,k,mmseeff,where T_l^,k is the unimodular matrix for H_l^,k,mmseeff. Then, the LR-MMSE relay forwarding filter is given by(31)Pl^,k,LR=ηl^,kH~_l^,k,LReffHH~_l^,k,LReffH~_l^,k,LReffH-1Ωl^,k,where the matrix ηl^,k=IMl^,k0(Nl^,k-Ml^,k)×Ml^,k and Ml^,k is the dimension of H~_l^,k,LReff. Since LR transformation can reduce the matrix dimension, there should be Nl^,k>Ml^,k. Finally, the systematic MMSE precoding scheme for all users is followed as (32)P=diagPl,1,LR⋯Pl,K,LR,Pl^,k,LR⋯Pl^,K,LR,F=diagfl,1,mmse⋯fl,K,mmse,fl^,k,mmse⋯fl^,K,mmse.Since the lattice reduced precoding matrixP has near orthogonal columns, the required transmit power will be reduced compared to the MMSE precoding algorithms. Thus, a better BER performance than that of the BD precoding algorithms can be achieved by the proposed LR-MMSE precoding algorithm. The left work for receiver is to quantize the signals d^ to the nearest vectors. The LR-MMSE algorithm is summarized in Algorithm 2.Algorithm 2:The LR-MMSE precoding algorithm.
Steps and their operations
Applying the MMSE Channel Inversion
(
1
)  Hmmse†=HH(HHH+αI)-1
(
2
)  for k = 1 : K
(
3
) [Ql^,k,mmseRl^,k,mmse]=QR(Hl^,k,mmse,0)
(
4
) fl^,k,mmse=Ql^,k,mmse
(
5
) Hl^,k,mmseeff=Hl^,kTΠl^,kQl^,k,mmseHl^,k=Ul^,k,mmseΛl^,k,mmseVl^,k,mmseH
(
6
) H_l^,k,mmseeff=[Hl^,k,mmseeff,σINl,k]
(
7
) [T_l^,k,H_l^,k,LReff]=CLLL(H_l^,k,mmseeff)
(
8
) ηl^,k=[IMl^,k0(Nl^,k-Ml^,k)×Ml^,k]
(
9
)  Pl^,k,LR=ηl^,k(H_l^,k,LReff)H[H_l^,k,LReff(H_l^,k,LReff)H]-1
(
10
)  end
Operate similar circulation to obtainfl,k,mmseandPl,k,mmsethen Compute overall precoding scheme
(
10
)  F=diag⁡{Fl,1,mmse⋯Fl,K,mmse,Fl^,k,mmse⋯Fl^,K,mmse}
(
11
)  P=diag⁡{Pl,1,LR⋯Pl,K,LR,Pl^,k,LR⋯Pl^,K,LR}
(
14
)  d^l^,k=Tl^,k-1dl^,k+ηl^,knl^,keff


## 5. Simulation and Performance Analysis

In this section, we analyze the proposed LR-MMSE algorithm in terms of computational complexity, architecture, BER, and achievable rates.


### 5.1. Computational Complexity Analysis

In this section, we measure the computational complexity of the precoding algorithms we have introduced by the total number of floating point operations Per Second (FLOPS). Note that the LR algorithm has complex variable, and the average complexity of CLLL algorithm has been given in [26] by FLOPS. The number of FLOPS for the complex QR decomposition and the real SVD operation are given in [27]. Moreover, the FLOPS number in a x×y complex SVD operation is equivalent to its extended 2x×2y real matrix. The total FLOPS number required by the matrix operations is summarized below:(i)
multiplication ofx×y and y×z complex matrices: 8xyz-2xz;(ii)
QR decomposition of ax×yx≤y complex matrix: 16y2x-x2y+1/3x3;(iii)
SVD of ax×yx≤y complex matrix by only obtaining Λ and V: 32yx2+2x3;(iv)
SVD of ax×yx≤y complex matrix by obtaining U and Λ and V: 84y2x+8yx2+9x3;(v)
inversion of ax×x real matrix by Gauss-Jordan elimination: 4x3/3;(vi)
inversion of ax×x complex matrix by Gauss-Jordan elimination: 16x3-8x2+2x.The FLOPS of three types of precoding schemes are shown in Tables1, 2, and 3, respectively. We assume the system is composed of 6 users (K=3) equipped 2 antennas and one relay station equipped 12 antennas. From Table 1, apparently, we know that the complexity of SVD is very large, resulting in the BD’s complexity reaching a level of million. On the contrary, the combined channel inversion needs only 22805.4 FLOPS which operates in merely one time. Meanwhile, the LR-MMSE can save 35% of FLOPS of MMSE, while MMSE has saved 89.8% of FLOPS of BD.Table 1
Computational complexity of BD in case (6, 2, 12).
Steps
Operations
FLOPS
Number
(
1
)
U
¯
l
^
,
k
Λ
¯
l
^
,
k
V
¯
l
^
,
k
H
64
K
(
N
¯
l
^
,
k
N
R
2
+
2
N
R
3
)
1880064
(
2
)
ObtainHl^,keff
2
K
(
8
N
l
,
k
N
R
N
¯
l
^
,
k
-
2
N
l
,
k
N
¯
l
^
,
k
)
22560
(
3
)
SVD onHl^,keff
16
K
(
4
N
¯
l
^
,
k
2
N
l
,
k
+
8
N
¯
l
^
,
k
N
l
,
k
2
+
9
N
l
,
k
3
)
114432Total 2017056Table 2
Computational complexity of MMSE in case (6, 2, 12).
Steps
Operations
FLOPS
Number
(
1
)
H
mmse
†
16
N
R
3
-
10
N
R
2
+
8
N
R
2
N
+
8
N
R
N
2
+
2
N
R
22805.4
(
2
)
Q
mmse
†
R
mmse
†
32
K
(
N
R
2
N
l
^
,
k
-
N
l
^
,
k
2
N
R
+
1
3
N
l
^
,
k
3
)
46592.64
(
3
)
ObtainHl^,k,mmseeff
2
K
(
8
N
l
,
k
N
R
N
¯
l
^
,
k
-
2
N
l
,
k
N
¯
l
^
,
k
)
22560
(
4
)
SVD onHmmseeff
16
K
(
4
N
¯
l
^
,
k
2
N
l
,
k
+
8
N
¯
l
^
,
k
N
l
,
k
2
+
9
N
l
,
k
3
)
114432Total 206389Table 3
Computational complexity of LR-MMSE in case (6, 2, 12).
Steps
Operations
FLOPS
Number
(
1
)
H
mmse
†
4
3
N
R
3
-
2
N
R
2
+
12
N
R
2
N
-
2
N
R
N
22805.4
(
2
)
Q
mmse
†
R
mmse
†
32
K
(
N
R
2
N
l
^
,
k
-
N
l
^
,
k
2
N
R
+
1
3
N
l
^
,
k
3
)
46592.64
(
3
)
ObtainHl^,keff
2
K
(
8
N
l
,
k
N
R
N
¯
l
^
,
k
-
2
N
l
,
k
N
¯
l
^
,
k
)
22560
(
4
)
H
_
l
^
,
k
,
LR
eff
CLLL transform
38387.97
(
5
)
P
l
^
,
k
,
LR
2
K
(
4
3
N
l
,
k
3
+
12
N
l
,
k
3
-
4
N
l
,
k
2
)
544Total 133169.5Next, we fix the antennas of users and reveal the low complexity of LR-MMSE’s property by enlarging the number of users. RulingNR=N, we can obtain the performance comparison in Figure 3.Figure 3
Computational complexity versusK by fixing each user’s antennas.Figure3 shows that the complexity of BD-type precoding scheme grows rapidly with the increase in k, while it grows gently with respect to MMSE and LR-MMSE. This phenomenon is due to the significant influence of dimensions with regards to SVD. Note that the QR decomposition also needs to be implemented in K times, though there is only one time of the combined channel inversion. But, the QR decomposition is simpler than SVD.


### 5.2. Performance Analysis in Architecture

Compared to the BD and MMSE scheme, the LR-MMSE has a simple architecture. At the site of each user, the decoding matrix can be omitted, since the precoding processing in formula (31) has directly decoded the effective channel. This outperformance can contribute to saving a significant power of mobile users, even the relay stations. Moreover, it is worth noting that we need not employ the self-interference eliminating technology, due to the combined channel inversion having included the channel information of the receiver.


### 5.3. BER Performance Analysis

Recall that, with the increase in SNR, we have(33)Ql^,k,mmseH¯l^,k≈0in the LR-MMSE algorithm. Thus, the MU-MIMO channel is approximately decoupled into equivalent SU-MIMO channel. In most schemes of considering the channel noise, RBD is a common method. A result is shown in [28], which is like formula (33), which is not converged to zeros. Comparing the above two characters, LR-MMSE has more accurate receiving.As we known, the condition number is a measurement of receiving error bits. In virtue of the defined condition number in [23],(34)condH=HF·H-1F,the channel matrix can be detected with respect to orthogonality. Taking an example in a system of linear equations,(35)Ax=b.There are three cases for different kinds of matrices:(i)
when the channel matrix is an orthogonal matrix, the condition number is 1;x will change a little with tiny changing b;(ii)
when it is a singular matrix, the condition number is∞; x will change significantly with tiny changing b; even b has not changed;(iii)
when it is a nonsingular but not orthogonal matrix, the condition number will be large, andx changes between the above two cases.As can be seen in Figure 4, the LR-MMSE has a smaller average cond(H) of the effective channel compared to MMSE and BD. Thus, a significant power reduction and better BER performance are obtained.Figure 4
Thecond(H) statistics of 1000 6∗6 channel matrices.


### 5.4. Achievable Sum-Rate Analysis

We have mentioned that LR-MMSE is similar to the LR-ZF. Thus, the received signal can be rewritten as(36)d^l^,k=Hl,kTfl,kHl^,kPl^,kdl^,k+Hl,kTfl^,kns+nl,k=Tl^,k-1dl^,k+ψl^,knl^,keff,where ψl^,k is a detecting scalar and ψl^,k=Hl^,k,mmseeff-1Tl^,k-1dl^,kF2. Ordering zl^,k=Tl^,k-1dl^,k, we have the normalization factor (37)ψl^,k=Hl^,k,mmseeff-1zl^,kF2=Ul^,k,mmseΛl^,k,mmseVl^,k,mmseH-1zl^,kF2=Ul^,k,mmseΛl^,k,mmse-1Vl^,k,mmseHzl^,kF2.For a unitary matrix, the norm satisfies(38)QxF2=xHQHQx=xHx=xF2.Thus, we have(39)Eηl^,k=EΛl^,k,mmse-1Vl^,k,mmseHzl^,kF2=ETrΛl^,k,mmse-1Vl^,k,mmseHzl^,kzl^,kHVl^,k,mmseΛl^,k,mmse-1=TrΛl^,k,mmse-1Vl^,k,mmseHEzl^,kzl^,kHVl^,k,mmseΛl^,k,mmse-1=ξl^,k,i2TrΛl^,k,mmse-1Vl^,k,mmseHVl^,k,mmseΛl^,k,mmse-1=ξl^,k,i2TrΛl^,k,mmse-2=∑i=1Leffξl^,k,i2λl^,k,i2,where ξl^,k,i is the transferring power of ith stream of zl^,k and λl^,k,i is the ith singular of Λl^,k,mmse. Naturally, the SNR with respect to the ith stream is given by(40)SNRl^,ki=ξl^,k,i2σl^,keff2∑i=1Leffξl^,k,i2/λl^,k,i2.Thus, the UEl,k’s achievable sum-rate is obtained as(41)rl,k=∑i=1Lefflog1+SNRl^,ki=∑i=1Lefflog1+ξl^,k,i2σl^,keff2ψl^,k.Note that rl,k decreases with ηl^,k and converges to a maximum with ξl^,k,12/λl^,k,12=ξl^,k,i2/λl^,k,i2=⋯=ξl^,k,Leff2/λl^,k,Leff2.


## 5.1. Computational Complexity Analysis

In this section, we measure the computational complexity of the precoding algorithms we have introduced by the total number of floating point operations Per Second (FLOPS). Note that the LR algorithm has complex variable, and the average complexity of CLLL algorithm has been given in [26] by FLOPS. The number of FLOPS for the complex QR decomposition and the real SVD operation are given in [27]. Moreover, the FLOPS number in a x×y complex SVD operation is equivalent to its extended 2x×2y real matrix. The total FLOPS number required by the matrix operations is summarized below:(i)
multiplication ofx×y and y×z complex matrices: 8xyz-2xz;(ii)
QR decomposition of ax×yx≤y complex matrix: 16y2x-x2y+1/3x3;(iii)
SVD of ax×yx≤y complex matrix by only obtaining Λ and V: 32yx2+2x3;(iv)
SVD of ax×yx≤y complex matrix by obtaining U and Λ and V: 84y2x+8yx2+9x3;(v)
inversion of ax×x real matrix by Gauss-Jordan elimination: 4x3/3;(vi)
inversion of ax×x complex matrix by Gauss-Jordan elimination: 16x3-8x2+2x.The FLOPS of three types of precoding schemes are shown in Tables1, 2, and 3, respectively. We assume the system is composed of 6 users (K=3) equipped 2 antennas and one relay station equipped 12 antennas. From Table 1, apparently, we know that the complexity of SVD is very large, resulting in the BD’s complexity reaching a level of million. On the contrary, the combined channel inversion needs only 22805.4 FLOPS which operates in merely one time. Meanwhile, the LR-MMSE can save 35% of FLOPS of MMSE, while MMSE has saved 89.8% of FLOPS of BD.Table 1
Computational complexity of BD in case (6, 2, 12).
Steps
Operations
FLOPS
Number
(
1
)
U
¯
l
^
,
k
Λ
¯
l
^
,
k
V
¯
l
^
,
k
H
64
K
(
N
¯
l
^
,
k
N
R
2
+
2
N
R
3
)
1880064
(
2
)
ObtainHl^,keff
2
K
(
8
N
l
,
k
N
R
N
¯
l
^
,
k
-
2
N
l
,
k
N
¯
l
^
,
k
)
22560
(
3
)
SVD onHl^,keff
16
K
(
4
N
¯
l
^
,
k
2
N
l
,
k
+
8
N
¯
l
^
,
k
N
l
,
k
2
+
9
N
l
,
k
3
)
114432Total 2017056Table 2
Computational complexity of MMSE in case (6, 2, 12).
Steps
Operations
FLOPS
Number
(
1
)
H
mmse
†
16
N
R
3
-
10
N
R
2
+
8
N
R
2
N
+
8
N
R
N
2
+
2
N
R
22805.4
(
2
)
Q
mmse
†
R
mmse
†
32
K
(
N
R
2
N
l
^
,
k
-
N
l
^
,
k
2
N
R
+
1
3
N
l
^
,
k
3
)
46592.64
(
3
)
ObtainHl^,k,mmseeff
2
K
(
8
N
l
,
k
N
R
N
¯
l
^
,
k
-
2
N
l
,
k
N
¯
l
^
,
k
)
22560
(
4
)
SVD onHmmseeff
16
K
(
4
N
¯
l
^
,
k
2
N
l
,
k
+
8
N
¯
l
^
,
k
N
l
,
k
2
+
9
N
l
,
k
3
)
114432Total 206389Table 3
Computational complexity of LR-MMSE in case (6, 2, 12).
Steps
Operations
FLOPS
Number
(
1
)
H
mmse
†
4
3
N
R
3
-
2
N
R
2
+
12
N
R
2
N
-
2
N
R
N
22805.4
(
2
)
Q
mmse
†
R
mmse
†
32
K
(
N
R
2
N
l
^
,
k
-
N
l
^
,
k
2
N
R
+
1
3
N
l
^
,
k
3
)
46592.64
(
3
)
ObtainHl^,keff
2
K
(
8
N
l
,
k
N
R
N
¯
l
^
,
k
-
2
N
l
,
k
N
¯
l
^
,
k
)
22560
(
4
)
H
_
l
^
,
k
,
LR
eff
CLLL transform
38387.97
(
5
)
P
l
^
,
k
,
LR
2
K
(
4
3
N
l
,
k
3
+
12
N
l
,
k
3
-
4
N
l
,
k
2
)
544Total 133169.5Next, we fix the antennas of users and reveal the low complexity of LR-MMSE’s property by enlarging the number of users. RulingNR=N, we can obtain the performance comparison in Figure 3.Figure 3
Computational complexity versusK by fixing each user’s antennas.Figure3 shows that the complexity of BD-type precoding scheme grows rapidly with the increase in k, while it grows gently with respect to MMSE and LR-MMSE. This phenomenon is due to the significant influence of dimensions with regards to SVD. Note that the QR decomposition also needs to be implemented in K times, though there is only one time of the combined channel inversion. But, the QR decomposition is simpler than SVD.


## 5.2. Performance Analysis in Architecture

Compared to the BD and MMSE scheme, the LR-MMSE has a simple architecture. At the site of each user, the decoding matrix can be omitted, since the precoding processing in formula (31) has directly decoded the effective channel. This outperformance can contribute to saving a significant power of mobile users, even the relay stations. Moreover, it is worth noting that we need not employ the self-interference eliminating technology, due to the combined channel inversion having included the channel information of the receiver.


## 5.3. BER Performance Analysis

Recall that, with the increase in SNR, we have(33)Ql^,k,mmseH¯l^,k≈0in the LR-MMSE algorithm. Thus, the MU-MIMO channel is approximately decoupled into equivalent SU-MIMO channel. In most schemes of considering the channel noise, RBD is a common method. A result is shown in [28], which is like formula (33), which is not converged to zeros. Comparing the above two characters, LR-MMSE has more accurate receiving.As we known, the condition number is a measurement of receiving error bits. In virtue of the defined condition number in [23],(34)condH=HF·H-1F,the channel matrix can be detected with respect to orthogonality. Taking an example in a system of linear equations,(35)Ax=b.There are three cases for different kinds of matrices:(i)
when the channel matrix is an orthogonal matrix, the condition number is 1;x will change a little with tiny changing b;(ii)
when it is a singular matrix, the condition number is∞; x will change significantly with tiny changing b; even b has not changed;(iii)
when it is a nonsingular but not orthogonal matrix, the condition number will be large, andx changes between the above two cases.As can be seen in Figure 4, the LR-MMSE has a smaller average cond(H) of the effective channel compared to MMSE and BD. Thus, a significant power reduction and better BER performance are obtained.Figure 4
Thecond(H) statistics of 1000 6∗6 channel matrices.


## 5.4. Achievable Sum-Rate Analysis

We have mentioned that LR-MMSE is similar to the LR-ZF. Thus, the received signal can be rewritten as(36)d^l^,k=Hl,kTfl,kHl^,kPl^,kdl^,k+Hl,kTfl^,kns+nl,k=Tl^,k-1dl^,k+ψl^,knl^,keff,where ψl^,k is a detecting scalar and ψl^,k=Hl^,k,mmseeff-1Tl^,k-1dl^,kF2. Ordering zl^,k=Tl^,k-1dl^,k, we have the normalization factor (37)ψl^,k=Hl^,k,mmseeff-1zl^,kF2=Ul^,k,mmseΛl^,k,mmseVl^,k,mmseH-1zl^,kF2=Ul^,k,mmseΛl^,k,mmse-1Vl^,k,mmseHzl^,kF2.For a unitary matrix, the norm satisfies(38)QxF2=xHQHQx=xHx=xF2.Thus, we have(39)Eηl^,k=EΛl^,k,mmse-1Vl^,k,mmseHzl^,kF2=ETrΛl^,k,mmse-1Vl^,k,mmseHzl^,kzl^,kHVl^,k,mmseΛl^,k,mmse-1=TrΛl^,k,mmse-1Vl^,k,mmseHEzl^,kzl^,kHVl^,k,mmseΛl^,k,mmse-1=ξl^,k,i2TrΛl^,k,mmse-1Vl^,k,mmseHVl^,k,mmseΛl^,k,mmse-1=ξl^,k,i2TrΛl^,k,mmse-2=∑i=1Leffξl^,k,i2λl^,k,i2,where ξl^,k,i is the transferring power of ith stream of zl^,k and λl^,k,i is the ith singular of Λl^,k,mmse. Naturally, the SNR with respect to the ith stream is given by(40)SNRl^,ki=ξl^,k,i2σl^,keff2∑i=1Leffξl^,k,i2/λl^,k,i2.Thus, the UEl,k’s achievable sum-rate is obtained as(41)rl,k=∑i=1Lefflog1+SNRl^,ki=∑i=1Lefflog1+ξl^,k,i2σl^,keff2ψl^,k.Note that rl,k decreases with ηl^,k and converges to a maximum with ξl^,k,12/λl^,k,12=ξl^,k,i2/λl^,k,i2=⋯=ξl^,k,Leff2/λl^,k,Leff2.


## 6. Simulation Results

Considering a specification of antenna withN=8, NR=10, and Nl,k=2, six users are divided into two symmetrical groups. The perfect channel scenario is applied in which σ=1 and all channels’ elements are fetched from the complex Gaussian process. For highlighting the performance of the proposed algorithm, we allocate the transmit power equally to each user.Figure5 shows that the LR-MMSE algorithm has the best sum-rate performance when MMSE and BD have a similar achievable sum-rate. In particular, when the SNR is 30 dB, the proposed algorithm has a 3.208 bit/s/Hz gain compared to the BD algorithm. Since the low SNR will affect the diagonality after the precoding processing in MMSE scheme, there is an inevitable performance loss. However, by virtue of the size reduction of CLLL transform, the LR-MMSE has obtained a performance compensation.Figure 5
The achievable sum-rate versus SNR.Additionally, in the process of simulating, we discover that choosing the optimal matching matrixΠ can achieve nearly 1 bit/s/Hz gain. In this work, we did not study the optimization of power and matching matrices.


## 7. Conclusion

In this work, we have proposed a low complexity precoding scheme of two-way MU-MIMO relay systems with QR decomposition and complex LLL transform instead of two times SVD. For simplicity, users are distributed in two symmetrical groups. The performance analysis show that the LR-MMSE algorithm has not only a low complexity, but also a better BER, a simple structure at the site of the receiving user, and a theoretical maximum. Finally, a higher achievable sum-rate of the system is confirmed by simulation.



---

*Source: 615202-2015-06-15.xml*