Open Access

MRT precoding in downlink multi-user MIMO systems

EURASIP Journal on Wireless Communications and Networking20162016:241

Received: 29 July 2016

Accepted: 20 September 2016

Published: 5 October 2016


This paper focuses on the design of maximum ratio transmission (MRT) precoding for multi-user multiple-input multiple-output (MU-MIMO) downlink transmission. Exiting block diagonalization (BD) precoding studies on MU-MIMO systems have the high complexity, because the transmitter precoding matrices constructed by singular value decomposition (SVD) are successively calculated twice. The MRT scheme construct precoding vectors aimed at each received antennas, respectively, so the signals of every antenna are independent. More spatial diversity gain can be obtained compared with BD precoding when MRT precoding and maximum ratio combining are employed. Simulations show that the proposed algorithm has many gains over the conventional BD precoding in various MU-MIMO systems.


MU-MIMO Precoding Multi-user interference Maximum ratio transmission

1 Introduction

The envisioned rapid increase of the wireless data traffic demand in the next years imposes rethinking current wireless cellular networks [1]. Multi-user (MU) multiple-input multiple-output (MIMO) systems have the potential of combining the high capacity by MIMO processing with the benefits of space-division multiple access (SDMA) [2]. In general, MU-MIMO systems not only suffer from the noise and the inner-antenna interference but are also affected by multi-user interference (MUI) during downlink transmission, which is means of channel-aware precoding methods implemented at the base station (BS). Precoding techniques for MIMO transmissions have recently gained increasing interest with the introduction of MU-MIMO, in which a large number of transmit antennas are used at the base station to simultaneously serve multiple receivers [3]. Nonlinear precoding methods such as dirty paper coding are performance achieving. However, these precoding are highly complex, thereby motivating the need for linear methods, which are computationally simpler. Channel inversion-based linear precoding algorithms such as zero-forcing channel inversion (ZF-CI) can still be used to cancel the MUI with the lower complexity. As the generalization of the ZF-CI precoding algorithm, the block diagonalization (BD) and regularized block diagonalization (RBD) precoding have been proposed for MU-MIMO systems in [46]. Singular value decomposition (SVD) operations are implemented twice for each user in BD precoding algorithm.

Over the last few years, many works have analyzed the zero-forcing beamforming for single-stream transmission per user and the zero-forcing precoding for multiple streams per user as the generalized single antenna [710]. As to the analysis of multiple streams, some researches for MU-MIMO focused on zero-forcing precoding, and it is noted that most of the previous works on BD precoding assumed designing the BD-type precoding schemes with less computational complexity. QR-decomposition-based BD (QR-BD), generalization ZF-CI (GZI), and lattice reduction (LR)-assisted precoding are proposed in [1114]. For the multiple streams system, we must do power control or the adaptive modulation and coding to balance the effective channel gain for each stream [15, 16], which gets the same SNR for much channel with the geometric mean decomposition (GMD); otherwise, the performance of each user will suffer significant loss. However, the power control or adaptive modulation is hard to achieve especially in the multiple antennas systems, suffering from high complexity and large signaling overhead.

In the following, we propose a new linear precoding scheme based on BD for a downlink MU-MIMO systems with multiple data streams per user. The design goal is simple and a low-complexity algorithm to compute the precoding matrix for each user without the power control. To do this, we introduce a slight relaxation for BD precoding with once SVD. Thereby, we obtain a general form which simultaneously diagonalizes covariance matrices through independently precoding.

The contribution of this work is that we develop a new BD precoding for downlink MU-MIMO system with multiple data streams per user to improve the BER performance without complex power, modulation, or coding. As detailed in the paper, the proposed algorithm is based on the multiple users and multiple streams MIMO systems which will be finally used for the derivation of the analytical system performance. A more thorough evaluation of proposed algorithm is confirmed via simulations. Furthermore, the new algorithm demonstrates a superiority performance.

The rest of the paper is organized as follows. Section 2 introduces the system model of MU-MIMO downlink transmissions. Then, the proposed maximum ratio transmission (MRT) precoding algorithm is detailed in Section 3. To examine the proposed transmission strategy in an efficient manner, a system-level simulator is designed. The benefits of the proposed transmission strategy are demonstrated through numerical simulations in Section 4. Finally, concluding remarks are drawn in Section 5.

We briefly summarize the notations used in this paper. Uppercase boldfaced letters are used to denote matrices and lowercase boldfaced letters for vectors. The superscripts (•)T, (•)*, (•)H note the transpose, conjugate, and conjugate transpose, respectively.

2 System model

2.1 System model

Consider downlink MU-MIMO system with one BS equipped with M transmits antennas and N received antennas (as shown in Fig. 1). Each BS simultaneously serves K number of l k -antennas users. Without loss of generality, we assume that the received antenna number l k for each user is the same. We consider a flat fading channel, we further assume that the channel state information (CSI) is perfectly known at the transmitter, and synchronization between the BS and the users is assumed.
Fig. 1

MU-MIMO system model

The channel matrix coupling the BS to the user is of the kth user set and modeled as the flat Rayleigh fading MIMO channel:
$$ {\boldsymbol{H}}_k=\left[\begin{array}{l}{h}_{11}\kern0.3em {h}_{12}\kern0.5em \cdots \kern0.5em {h}_{1M}\\ {}{h}_{21}\kern0.3em {h}_{22}\kern0.5em \cdots \kern0.3em {h}_{2M}\\ {}\vdots \kern2em \vdots \kern0.8em \ddots \kern1.1em \vdots \\ {}{h}_{l_k1}\kern0.3em {h}_{l_k2}\kern0.3em \cdots \kern0.3em {h}_{l_kM}\end{array}\right] $$
where \( {\boldsymbol{H}}_k\in {\mathbb{C}}^{l_k\times M} \) is MIMO channel matrix for the user k and the element h u,v indicates the channel impulse response coupling the k transmit antenna to the received antenna. The system channel matrix is as follows:
$$ \boldsymbol{H}={\left[{\boldsymbol{H}}_1^{\mathrm{T}}\kern0.3em {\boldsymbol{H}}_2^{\mathrm{T}}\kern0.3em \cdots \kern0.3em {\boldsymbol{H}}_k^{\mathrm{T}}\right]}^{\mathrm{T}} $$
The received signal y k for user k is given by:
$$ {y}_k={\boldsymbol{H}}_k{\boldsymbol{P}}_k{\boldsymbol{s}}_k+{\boldsymbol{H}}_k{\displaystyle \sum_{i=1,i\ne k}^K{\boldsymbol{P}}_i{\boldsymbol{s}}_i}+{n}_k $$
where P k is the precoding matrix for user k. \( {\boldsymbol{s}}_k=\left[{s}_k^1\kern0.5em {s}_k^2\kern0.5em \cdots \kern0.5em {s}_k^{r_k}\right] \) is the transmission symbol vector for the kth user set, r k  ≤ l k . n k is the kth user’s additive white Gaussian noise (AWGN) with zero-mean and σ 2 variance, that is, CN (0, σ2) for all user terminals.
$$ \boldsymbol{P}=\left[{\boldsymbol{P}}_1\kern0.5em {\boldsymbol{P}}_2\kern0.5em \cdots {\boldsymbol{P}}_K\right] $$
$$ \boldsymbol{S}={\left[{\boldsymbol{s}}_1^T\kern0.5em {\boldsymbol{s}}_2^T\kern0.5em \cdots {\boldsymbol{s}}_K^T\right]}^T $$
where P M × t and S are the precoding matrix and the transmit signal for K users, respectively. The total data stream for K users is t, and t ≤ rank (H).

2.2 MUI as interference

We can consider the MUI as an additive interference, affecting the useful signal. The useful symbol is weighted by the equivalent channel frequency response, which is the sum of random variables of channels. In Eq. (3), \( {\boldsymbol{H}}_k{\displaystyle \sum_{i=1,i\ne k}^K{p}_i{s}_i} \) is the MUI contribution. In this paper, the interference models based on classical approximation or on other distributions are assumed to be independent from the useful term.

3 Precoding scheme

3.1 BD precoding algorithms

As the generalization of the ZF precoding algorithm, the design of BD-based precoding algorithms is performed in two steps [4, 17]. Two SVD operations are implemented for each user in the BD precoding algorithm. The first SVD eliminate completely the MUI from other users for MU-MIMO channel. Thus, the MU-MIMO channel is decomposed into multiple parallel single-user MIMO (SU-MIMO) channels. The second SVD operation is implemented to parallelize each user’s streams and obtain maximum precoding gain for each sub-stream to further improve the performance. Precoding matrix for the system is the product of the matrixes of the two steps.

The interference channel matrix for the kth user.
$$ {\tilde{\boldsymbol{H}}}_{\mathtt{k}}={\left[{\boldsymbol{H}}_1^{\mathrm{T}}\cdots \kern0.4em {\boldsymbol{H}}_{\mathtt{k}-1}^{\mathrm{T}}\kern0.5em {\boldsymbol{H}}_{\mathtt{k}+1}^{\mathrm{T}}\cdots \kern0.3em {\boldsymbol{H}}_{\mathtt{K}}^{\mathrm{T}}\right]}^{\mathrm{T}} $$

In order to eliminate completely the MUI, that is H i P k  = 0, i ≠ k, P k in the zero space of \( {\tilde{\boldsymbol{H}}}_k \).

SVD decomposition for \( {\tilde{\boldsymbol{H}}}_k \).
$$ {\tilde{\boldsymbol{H}}}_{\mathtt{k}}={\tilde{\boldsymbol{U}}}_{\mathtt{k}}{\tilde{\boldsymbol{\varSigma}}}_{\mathtt{k}}{\left[{\tilde{\boldsymbol{V}}}_{\mathtt{k}}^{(1)}\kern0.6em {\tilde{\boldsymbol{V}}}_{\mathtt{k}}^{(0)}\right]}^{\mathrm{H}} $$
where \( {\tilde{\boldsymbol{V}}}_k^{(1)} \) is the right-singular matrix with non-zero singular value and \( {\tilde{\boldsymbol{V}}}_k^{(0)} \) is the right-singular matrix with zero singular value. When the BD algorithm is employed as the precoding technique, the equivalent single-user channel matrix after the MUI elimination is shown. Therefore, \( {\tilde{\boldsymbol{V}}}_{\mathtt{k}}^{(0)} \) is the zero space of \( {\tilde{\boldsymbol{H}}}_{\mathtt{k}} \).
The equivalent channel of the kth user can be given as:
$$ {\boldsymbol{H}}_{\mathrm{eff}\mathtt{k}}={\boldsymbol{H}}_{\mathtt{k}}{\tilde{\boldsymbol{V}}}_{\mathtt{k}}^{(0)} $$
When the BD algorithm is employed, the norm of the equivalent channel after precoding equals the norm of the projected channel.
$$ {\left\Vert {\boldsymbol{H}}_i{\tilde{\boldsymbol{V}}}_i\right\Vert}_F^2={\left\Vert {\boldsymbol{H}}_{\mathtt{i}}{\tilde{\boldsymbol{P}}}_i\right\Vert}_{\mathtt{F}}^2\kern0.24em i=1,\cdots K $$
where \( {\tilde{\boldsymbol{P}}}_i \) is a projection matrix that serves to the channel matrix of the user of i.
The SVD decomposition for H effk is:
$$ {\boldsymbol{H}}_{\mathrm{eff}\mathtt{k}}={\boldsymbol{H}}_{\mathtt{k}}{\tilde{\boldsymbol{V}}}_{\mathtt{k}}^{(0)}={\boldsymbol{U}}_{\mathtt{k}}\left[{\boldsymbol{\varSigma}}_{\mathtt{k}}\kern0.6em \mathbf{0}\right]{\left[{\boldsymbol{V}}_{\mathtt{k}}^{(1)}\kern0.6em {\boldsymbol{V}}_{\mathtt{k}}^{(0)}\right]}^{\mathrm{H}} $$
in the same way, where the right-singular matrix with non-zero singular value is \( {\boldsymbol{V}}_{\mathtt{k}}^{(1)} \) and \( {\boldsymbol{V}}_{\mathtt{k}}^{(0)} \) is the right-singular matrix with zero singular value. The precoding vector can be written as:
$$ \boldsymbol{P}=\left[{\tilde{\boldsymbol{V}}}_1^{(0)}{\boldsymbol{V}}_1^{(1)}\kern0.6em \cdots \kern0.6em {\tilde{\boldsymbol{V}}}_K^{(0)}{\boldsymbol{V}}_K^{(1)}\right] $$
Therefore, the relation (3) will be rewritten.
$$ \begin{array}{l}\boldsymbol{y}=\boldsymbol{H}\boldsymbol{P}\boldsymbol{x} + \boldsymbol{n}=\left(\begin{array}{ccc}\hfill {\boldsymbol{H}}_1{\boldsymbol{P}}_1\hfill & \hfill \cdots \hfill & \hfill {\boldsymbol{H}}_1{\boldsymbol{P}}_K\hfill \\ {}\hfill \vdots \hfill & \hfill \ddots \hfill & \hfill \vdots \hfill \\ {}\hfill {\boldsymbol{H}}_K{\boldsymbol{P}}_1\hfill & \hfill \cdots \hfill & \hfill {\boldsymbol{H}}_K{\boldsymbol{P}}_K\hfill \end{array}\right)\boldsymbol{x}+\boldsymbol{n}\\ {}\kern3.72em =\left(\begin{array}{ccc}\hfill {\boldsymbol{H}}_1{\boldsymbol{P}}_1\hfill & \hfill \cdots \hfill & \hfill 0\hfill \\ {}\hfill \vdots \hfill & \hfill \ddots \hfill & \hfill \vdots \hfill \\ {}\hfill 0\hfill & \hfill \cdots \hfill & \hfill {\boldsymbol{H}}_K{\boldsymbol{P}}_K\hfill \end{array}\right)\boldsymbol{x}+\boldsymbol{n}\end{array} $$
The receive vector of the kth user can be given as:
$$ {\boldsymbol{y}}_{\mathtt{k}}={\boldsymbol{H}}_{\mathtt{k}}{\boldsymbol{P}}_{\mathtt{k}}{\boldsymbol{x}}_{\mathtt{k}}+{\displaystyle \sum_{\mathtt{i}\ne \mathtt{k}}^{\mathtt{K}}{\boldsymbol{H}}_{\mathtt{i}}{\boldsymbol{P}}_{\mathtt{i}}{\boldsymbol{x}}_{\mathtt{i}}+{\boldsymbol{n}}_{\mathtt{k}}} $$
Thus, from (13), the interference is eliminated completely. The kth user’s decoding matrix is expressed as:
$$ {\boldsymbol{D}}_{\mathtt{k}}={\boldsymbol{U}}_{\mathtt{k}}^{\mathrm{H}} $$

BD precoding provides better performance due to the unitary precoding. However, the drawback of such precoding scheme-based BD is that the effective channel gain for each stream is severely destroyed by the interference. It is known that the overall performance of a user with multiple streams is dominated by the stream with the worst channel condition. Hence, interference would lead to poor overall error performance for a user. In the next section, we design a new precoding scheme so as to overcome this drawback.

3.2 Proposed precoding

For the conventional BD precoding, the interferences are involved in the received signals. This will be a key aspect and have to be specifically studied in our study. In the following, we drive a new BD precoding by constructing the interference matrix independently in a MU-MIMO system using QPSK modulation. We focus on the two-user and three-user cases to provide analysis. The further study will give the new information about the arbitrary number of antennas.

Firstly, calculate the precoding vector of each receiving antenna by the first SVD. Then, the precoding matrix of the kth user denoted P k , which each column is calculated separately for each receiving antenna.

Let us define \( {\overline{\boldsymbol{H}}}_k^{\left(\mathtt{i}\right)} \) to be the interference channel matrix of the ith antenna at the kth user.
$$ {\overline{\boldsymbol{H}}}_k^{\left(\mathtt{i}\right)}=\left(\begin{array}{c}\hfill {\boldsymbol{H}}_{\mathrm{k}\left(\overline{i}\right)}\hfill \\ {}\hfill {\boldsymbol{H}}_1\hfill \\ {}\hfill \vdots \hfill \\ {}\hfill {\boldsymbol{H}}_{k-1}\hfill \\ {}\hfill {\boldsymbol{H}}_{k+1}\hfill \\ {}\hfill \vdots \hfill \\ {}\hfill {\boldsymbol{H}}_K\hfill \end{array}\right) $$
where \( {\overline{\boldsymbol{H}}}_k^{(i)} \) is the kth channel matrix that removed the ith line. \( {\overline{\boldsymbol{H}}}_k^{(i)} \) can be expressed through SVD and described by:
$$ {\overline{\boldsymbol{H}}}_k^{\left(\mathtt{i}\right)}={\overline{\boldsymbol{U}}}_k^{\left(\mathtt{i}\right)}{\overline{\boldsymbol{\varSigma}}}_k^{\left(\mathtt{i}\right)}{\left[{\overline{\boldsymbol{V}}}_k^{\left(\mathtt{i}\right)(1)}\kern0.6em {\overline{\boldsymbol{V}}}_k^{\left(\mathtt{i}\right)(0)}\right]}^{\mathrm{H}} $$
where \( {\overline{\boldsymbol{V}}}_k^{\left(\mathtt{i}\right)(1)} \) is the right-singular matrix with non-zero singular value and \( {\overline{\boldsymbol{V}}}_k^{\left(\mathtt{i}\right)(0)} \) is the right-singular matrix with non-zero singular value. Therefore, \( {\overline{\boldsymbol{V}}}_k^{\left(\mathtt{i}\right)(0)} \) is the zero space of \( {\overline{\boldsymbol{H}}}_k^{\left(\mathtt{i}\right)} \). For the kth user, MRT precoding is given by:
$$ {\overline{\boldsymbol{P}}}_k=\left[{\overline{\boldsymbol{P}}}_k^{\left(\mathtt{1}\right)},{\overline{\boldsymbol{P}}}_k^{\left(\mathtt{2}\right)},\dots, {\overline{\boldsymbol{P}}}_k^{\left({l}_k\right)}\right] $$
The total number of the receiver antennas is l k , the new precoding matrix of the ith receiver antenna at the kth user (M dimension column) denotes \( {\overline{\boldsymbol{P}}}_{\mathtt{k}}^{\left(\mathtt{i}\right)}={\overline{\boldsymbol{V}}}_{\mathtt{k}}^{\left(\mathtt{i}\right)(0)}(l) \), and \( \overline{{\boldsymbol{P}}_k} \) is the precoding matrix for the kth user (l k  × M dimension). Further, the receiver vector at user k is written as:
$$ {\overline{\boldsymbol{y}}}_k={\boldsymbol{H}}_k\overline{{\boldsymbol{P}}_k}{\boldsymbol{x}}_k+{\displaystyle \sum_{\mathtt{i}=1,\mathtt{i}\ne k}^{\mathtt{K}}{\boldsymbol{H}}_k\overline{{\boldsymbol{P}}_k}{\boldsymbol{x}}_{\mathtt{i}}+{\boldsymbol{n}}_k}={\varPsi}_k{\boldsymbol{x}}_k+{\boldsymbol{n}}_k $$
where the first part is the coefficient of the receiver antenna at user k, \( {\varPsi}_k={\boldsymbol{H}}_k\overline{{\boldsymbol{P}}_k} \) (l k is the dimension column), the second part is the MUI, and \( {\boldsymbol{H}}_k\overline{{\boldsymbol{P}}_i} \) is zero obviously. So, the interference of the antenna of equivalent channel is eliminated.
Then, the maximal ratio combination (MRC) for the received symbols for the entire antenna at user k is written as:
$$ {\overline{\overline{\boldsymbol{y}}}}_k={\displaystyle \sum_{i=1}^{l_k}{\overline{\boldsymbol{y}}}_k(i)}\cdot {\varPsi}_k^{*}(i) $$

Finally, the estimated result at user k is get, through the hard decision for the received symbol \( {\overline{\overline{\boldsymbol{y}}}}_{\mathtt{k}} \).

4 Simulation results

In this section, we investigate the performance of the proposed scheme for MU-MIMO downlink system by means of Monte-Carlo simulations, comparing it with the original proposed BD precoding. A spatially uncorrelated flat Rayleigh fading of the wireless channel is assumed, and the noise distributed complex Gaussian variables with zero-mean and unit-variance, considering quadrature phase shift keying (QPSK) modulation.

For simplicity but without loss of generality, we consider that the number of received antennas for each user is the same, which equal to the total data streams of the transmit user. Then, we study the performance of the MU-MIMO system for the different antenna configuration by simulations. We compare the simulated bit error rate (BER) in a MU-MIMO system with different system transmission and the antenna configuration.

Figure 2 compares the BD precoding with two streams and every stream using SVD decomposition. The BD precoding scheme operate two SVD for each user and the interference is introduced, so the performance highly affected by the worst channel conditions for multi-streams transmission. Because BD precoding algorithm effective channel gains unbalance between different data flows, it leads to the poor performance of the system. It can be observed that as SNR increased, the performance of BER improved obviously for the SVD decomposition of each stream. This shows that the interference is influenced by the system performance even with a low SNR, then the performance would be worse than the once SVD decomposition.
Fig. 2

Comparison of the BER performance for BD two streams and the every stream using SVD decomposition

By comparing the performance of BD precoding of two streams, we can summarize the conclusion, and a significant interference is introduced in the BD precoding. It is observed in simulation conditions. So, it can be concluded that BD precoding is not a suitable approach for MUI scenarios and dense network. It is important to recall that gains are obtained even in SVD decomposition only once and as SNR is increased, higher impact of interference on performance is observed. But in MU-MIMO systems, the MUI is also important.

As is shown in Fig. 3, we compare the BER for every stream when an MRT is used for transmission from BS to the UEs. The BER curves are plotted versus the transmit SNR with the antenna configuration for {2, 2} × 4, M = 4, n k  = 2, and K = 2. We compared the BER for the conventional BD and the proposed MRT precoding schemes with the same antenna configuration, using the multiplexing strategy. As expected, the proposed MRT precoding scheme performs better BER than the conventional BD precoding algorithm. Because the BD precoding scheme operate two SVD and the interference is introduced, therefore, the performance of single data stream is better than multiple data streams for BD precoding scheme. The MRT precoding SVD operation only once and therefore reduces the interference and computational complexity.
Fig. 3

Comparison of the BER performance for BD and MRT algorithm with multiplexing strategy, where the antenna {2, 2} × 4

In Fig. 4, the BER curves versus the transmit SNR are plotted. We compared the BER for the conventional BD, ZF, and the proposed MRT precoding schemes with the same antenna configuration {2, 2} × 4, using the diversity strategy. The MRT precoding and MRC for BD is operated at the transmitter and receiver, respectively, when the multiple data stream is sent. Compared with Fig. 2, the BER has declined significantly, since the multi-way spatial diversity was obtained. So it can be concluded that MRT is a suitable approach for interference limited scenarios and dense networks. It is important to include that large gains are obtained and that no additional overhead is needed for MRT if we use UL transmission.
Fig. 4

Comparison of the BER performance for BD and MRT algorithm with diversity strategy, where the antenna {2, 2} × 4

To further understand the proposed scheme, Fig. 5 shows the result of the MU-MIMO system with the space diversity for the antenna configuration of M = 6, n k  = 3, and K = 3. It can be observed that we can get the similar performance conclusions as in Fig. 4, and the proposed MRT precoding scheme has better performance than the conventional ZF and BD precoding algorithm. As the SNR increased, higher impact of the interference on performance and more gains obtained are observed.
Fig. 5

Comparison of the BER performance for BD and MRT algorithm with the antenna {3, 3} × 6

5 Conclusions

In this paper, a low-complexity linear precoding scheme named MRT precoding is proposed in downlink MU-MIMO systems. The MRT precoding scheme introduces a designed precoding matrix operation to mitigate the interference and then to obtain the gain with the MRC. In contrast to the existing BD-type precoding, the main focus of this work is motivated by the low complexity and the better performance. Our algorithm was shown to be valid for multiple data streams, which reduces the interference among the antennas. The theoretical derivation and simulation show that the MRT precoding can achieve better BER and reliability but requires the lower computational complexity.



This work was supported in part by the National Natural Science Foundation of China (NSFC) under Grant 61501325, 61362027, and 61461036, the Natural Science Foundation of Inner Mongolia Autonomous Region of China under Grant 2016MS0604, and the Doctor Foundation of Tianjin Normal University under Grant 52XB1507.

Competing interests

The authors declare that they have no competing interests.

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

Authors’ Affiliations

College of Electronic Information Engineering, Inner Mongolia University
Tianjin Key Laboratory of Wireless Mobile Communications and Power Transmission, Tianjin Normal University


  1. Z Gao, L Dai, MmWave massive-MIMO-based wireless backhaul for the 5G ultra-dense network. IEEE Wirel. Commun. 21(5), 13–21 (2015)MathSciNetView ArticleGoogle Scholar
  2. QH Spencer, AL Swindlehurst, M Haardt, An introduction to the multi-user MIMO downlink. IEEE Commun. Mag. 42(10), 60–67 (2004)View ArticleGoogle Scholar
  3. H Sung, S Lee, I Lee, Generalized Channel Inversion Methods for Multiuser MIMO Systems. IEEE Trans. Commun. 57(11), 3489-3499 (2009)View ArticleGoogle Scholar
  4. QH Spencer, AL Swindlehurst, M Haardt, Zero-forcing methods for downlink spatial multiplexing in multi-user MIMO channels. IEEE Trans. Signal Process. 52(2), 461–471 (2004)MathSciNetView ArticleGoogle Scholar
  5. V Stankovic, M Haardt, Generalized design of multi-user MIMO precoding matrices. IEEE Trans. Wirel. Commun. 7(3), 953–961 (2008)View ArticleGoogle Scholar
  6. V Stankovic, M Haardt, “Linear and nonlinear multi-user MIMO precoding,” presented at the WWRF, Shanghai, China, Nov. 2006, WWRF Paper 16, 2006Google Scholar
  7. J Wu, S Fang, L Li et al., QR decomposition and gram Schmidt orthogonalization based low-complexity multi-user MIMO precoding, in Wireless Communications, Networking and Mobile Computing (WiCOM), 2014, pp. 61–66Google Scholar
  8. H Fu, M Crussiere, M Helard, BER analysis for equal gain transmission in downlink multiuser MIMO systems. IEEE Wireless Commun. Lett. 4(5), 533–536 (2015)View ArticleGoogle Scholar
  9. S Zarei, W Gerstacker, R Schober, Low-complexity widely-linear precoding for downlink large-scale MU-MISO systems. IEEE Commun. Lett. 19(4), 665–668 (2015)View ArticleGoogle Scholar
  10. C Feng, Y Jing, S Jin, Interference and outage probability analysis for massive MIMO downlink with MF precoding. IEEE Trans. Signal Process. 53(7), 665–668 (2015)Google Scholar
  11. H Sung, SR Lee, I Lee, Generalized channel inversion methods for multiuser MIMO systems. IEEE Trans. Commun. 57(11), 3489–3499 (2009)View ArticleGoogle Scholar
  12. K Zu, RC De Lamare, M Haardt, Generalized design of low-complexity block diagonalization type precoding algorithms for multiuser MIMO systems. IEEE Trans. Commun. 57, 4232–4242 (2013)View ArticleGoogle Scholar
  13. S Fang, J Wu, C Lu et al., Simplified QR-decomposition based and lattice reduction-assisted multi-user multiple-input-multiple-output precoding scheme. IET Commun. 10(5), 586–593 (2015)View ArticleGoogle Scholar
  14. S Lagen, A Agustin, J Vidal, Decentralized coordinated precoding for dense TDD small cell networks. IEEE Trans. Wirel. Commun. 14(3), 4546–4561 (2015)View ArticleGoogle Scholar
  15. Y Cheng, S Li, J Zhang et al., An efficient transmission strategy for the multicarrier multiuser MIMO downlink. IEEE Trans. Veh. Technol. 63(2), 628–642 (2014)View ArticleGoogle Scholar
  16. D Lee, Performance analysis of zero-forcing-precoded scheduling system with adaptive modulation for multiuser-multiple input multiple output transmission. IET Commun. 9(16), 2007–2012 (2015)View ArticleGoogle Scholar
  17. LU Choi, RD Murch, A transmit preprocessing technique for multiuser MIMO systems using a decomposition approach. IEEE Trans. Wirel. Commun. 3(1), 20–24 (2004)View ArticleGoogle Scholar


© The Author(s). 2016