Open Access

Linear precoding design for massive MIMO based on the minimum mean square error algorithm

EURASIP Journal on Embedded Systems20172017:20

DOI: 10.1186/s13639-016-0064-4

Received: 10 March 2016

Accepted: 29 November 2016

Published: 25 January 2017

Abstract

Compared with the traditional multiple-input multiple-output (MIMO) systems, the large number of the transmit antennas of massive MIMO makes it more dependent on the limited feedback in practical systems. In this paper, we study the problem of precoding design for a massive MIMO system with limited feedback via minimizing mean square error (MSE). The feedback from mobile users to the base station (BS) is firstly considered; the BS can obtain the quantized information regarding the direction of the channels. Then, the precoding is designed by considering the effect of both noise term and quantization error under transmit power constraint. Simulation results show that the proposed scheme is robust to the channel uncertainties caused by quantization errors.

Keywords

Massive MIMO Precoding Minimum mean square error (MMSE) Limited feedback

1 Introduction

Multiple-input multiple-output (MIMO) techniques have gained considerable attention in modern wireless communications since it can significantly improve the capacity and reliability of wireless systems [1]. The essence of downlink multiuser MIMO is precoding, which means that the antenna arrays are used to direct each data signal spatially towards its intended receiver. Unfortunately, the precoding design in multiuser MIMO requires very accurate instantaneous channel state information (CSI) [2] which can be cumbersome to achieve in practice. To further achieve more dramatic gains as well as to simplify the required signal processing, massive MIMO techniques have been proposed in [3, 4] by installing a large number of antennas at base stations (BS), possibly in the order of tens or hundreds, which promises significant performance gains in terms of spectral efficiency and energy efficiency compared with conventional MIMO and is becoming a cornerstone of future 5G systems [5, 6].

From a practical point of view, realizing massive MIMO systems has to deal with several challenges, one of which is the low-complexity and near-optimal precoding scheme [7, 8]. Generally, precoding approaches can be classified into nonlinear precoding and linear precoding. The optimal precoding is the nonlinear dirty paper precoding (DPC) [9], which can effectively eliminate the interference between different users and achieve optimal performance. However, nonlinear precoding schemes usually suffer from high complexity which makes them unpractical due to the hundreds of antennas in massive MIMO systems. Since the asymptotic orthogonality of massive MIMO channel matrix, simple linear precoding (e.g., zero-forcing (ZF) precoding) can be used to achieve capacity-approaching performance. Nevertheless, ZF precoding requires matrix inversion of very large size, which exhibits prohibitively high complexity. To reduce the complexity of matrix inversion of large size, a Neumann-based precoding is proposed in [10] to reduce the computational complexity in an iterative method, but the required complexity is still unaffordable. Recently, a low peak-to-average power ratio (PAPR) precoding based on the approximate message passing (AMP) algorithm [11] and a successive over-relaxation (SOR)-based precoding [12] are respectively proposed to minimize multiuser interference (MUI) in massive multiuser MIMO systems. The aforementioned works are based on the assumption of a perfect CSI at the BS, which is somewhat too optimistic for practical applications. As a result, it is essential to investigate the robust precoding design in massive MIMO systems.

Inspired by the abovementioned works, in this paper, we study the precoding design for a single-cell downlink massive MIMO system with limited feedback, while guaranteeing transmit power constraint. Each user terminal (UT) feeds back the quantized side information to BS to assist its transmission. We propose a linear precoder design scheme via the minimum mean square error (MMSE) criteria with respect to the CSI imperfection. The proposed scheme is an improved approach, which is robust to the channel uncertainties caused by quantization errors and the lack of channel quality information (CQI).

The rest of this paper is organized as follows. In Section 1, the system mode of massive MIMO is introduced and the problem is formulated. In Section 2, a linear precoder based on MMSE criteria is designed by considering the impact of the noise term and CSI quantization error. Numerical results are presented in Section 3. Finally, concluding remarks are made in Section 4.

Notations: Throughout this paper, boldface lowercase and uppercase letters denote vectors and matrices, respectively. The transpose, conjugate transpose, trace, and Frobenius norm of a matrix A are denoted as A T, A H, tr(A), ‖A F , respectively. I M × M denotes a M × M identity matrix. Ε[] denotes the expectation operator. diag() stands for a diagonal matrix with the given elements on the diagonal. Re() represents the real part of the input.

2 System model

We consider a single-cell downlink multiuser massive MIMO system, as depicted in Fig. 1. For massive MIMO downlink transmissions, a large number of antennas N T that are equipped at the BS is serving K UTs with each UT being equipped with n r antennas and the total receive antennas of UTs is N R  = Kn r . Here, \( \mathbf{H}\in {C}^{N_T\times {N}_R}=\left[{\mathbf{H}}_1,{\mathbf{H}}_2,\dots, {\mathbf{H}}_K\right] \) denotes the fast fading channel matrix from BS to the UTs, where each element is a zero mean unit variance independent and identical distributed (i.i.d) complex Gaussian. Let \( \mathbf{D}=\mathbf{H}{\mathbf{D}}_{\mu}^{1/2} \), thus \( {\mathbf{D}}_{\mu}^{1/2}=\mathrm{diag}\left\{\sqrt{\mu_1},\sqrt{\mu_2},\dots, \sqrt{\mu_K}\right\} \) denotes slow fading diagonal matrix.
Fig. 1

System model

Then, the total received signal \( \mathbf{y}={\left[{\mathbf{y}}_1^{\mathrm{T}},{\mathbf{y}}_2^{\mathrm{T}},\dots, {\mathbf{y}}_K^{\mathrm{T}}\right]}^{\mathrm{T}} \) at all UTs is given by
$$ \mathbf{y}={\mathbf{D}}^{\mathrm{H}}\mathbf{W}\mathbf{x}+\mathbf{n}, $$
(1)
where x is the signals transmitted by the BS and n is an additive white Gaussian noise with zero mean and variance σ 2. W = [W 1, W 2, , W K ] is the transmitting precoding matrix. Denoting P T as the power constraint at BS, the total transmit power at BS is limited by tr(WW H) ≤ P T .

We assume that each UT can perfectly estimate the downlink CSI and send it back to ST using local feedback. All of the feedback channels are assumed to be noiseless and delay free. To facilitate analysis, the channel is decomposed into the channel direction information (CDI) and CQI [11]. The kth UT estimates the CSI of channel D k perfectly and quantizes the CDI \( {\tilde{\mathbf{D}}}_k={\mathbf{D}}_k/\left\Vert {\mathbf{D}}_k\right\Vert \) to a unit norm vector \( {\widehat{\mathbf{D}}}_k. \)

The acquisition of D k at BS can be accomplished via channel feedback. The quantized CDI \( {\widehat{\mathbf{D}}}_k \) is chosen from a predefined codebook C that consists of 2 B codeword matrices \( \left\{{C}_1,{C}_2,\cdots, {C}_{2^B}\right\} \), where B is the bit size of the codeword vector. Each UT quantizes its channel to the quantization vector that is closest to its channel vector, where closeness is measured in terms of the angle between two vectors or, equivalently, the inner product [12, 13]. Thus, the quantization of kth UT is chosen according to the minimum angle criterion as
$$ \begin{array}{l}{\widehat{\mathbf{D}}}_k= \arg \underset{C_i\in C}{ \max}\left|{\tilde{\mathbf{D}}}_k^{\mathrm{H}}{C}_i\right|\hfill \\ {}\kern0.84em = \arg \underset{C_i\in C}{ \min }{ \sin}^2\left(\angle \left({\tilde{\mathbf{D}}}_k,{C}_i\right)\right)\hfill \end{array}, $$
(2)
and each UT feeds back the B bits codeword indices to the BS. Due to simplicity and analytical tractability, we employ random vector quantization (RVQ) for the codebook design where \( {\left\{{C}_i\right\}}_{i=1}^{2^B} \) are chosen independently and isotropically on the N T -dimensional unit sphere [14]. Throughout the paper, we assume that this CQI is known perfectly to the BS, i.e., it is not quantized; thus, no CQI is fed back to the BS.

3 Linear precoder design

In this section, we introduce a linear precoder design scheme that considers the effect of both noise term and quantization error.

3.1 Channel model

In the following, according to [15], the subspace of the true channel matrix can be decomposed as the weighted sum of the quantized channel and an independent and isotropic quantization error term.
$$ {\tilde{\mathbf{D}}}_k={\widehat{\mathbf{D}}}_k{\mathbf{X}}_k{\mathbf{Y}}_k+{\mathbf{S}}_k{\mathbf{Z}}_k{n}_r, $$
(3)
where D k is an orthonormal basis for the subspace spanned by the columns of D k . \( {\mathbf{X}}_k\in {C}^{n_r\times {n}_r} \) is a unitary matrix; \( {\mathbf{Y}}_k\in {C}^{n_r\times {n}_r} \) is upper triangular with positive diagonal elements and satisfies \( {\mathbf{Y}}_k^{\mathrm{H}}{\mathbf{Y}}_k={\mathbf{I}}_{n_r}-{\mathbf{Z}}_k^{\mathrm{H}}{\mathbf{Z}}_k \). \( {\mathbf{Z}}_k\in {C}^{n_r\times {n}_r} \) is upper triangular with positive diagonal elements and represents the quantization error, satisfying \( \operatorname{tr}\left({\mathbf{Z}}_k^{\mathrm{H}}{\mathbf{Z}}_k\right)={ \sin}^2\left(\angle \left({\tilde{\mathbf{D}}}_k,{\widehat{\mathbf{D}}}_k\right)\right) \). S k is an orthonormal basis for an isotropically distributed n r -dimensional plane in the left null space of \( {\widehat{\mathbf{D}}}_k \).
Therefore, the broadcast channel D k can be decomposed as
$$ \mathbf{D}=\left[\widehat{\mathbf{D}}{\left({\mathbf{I}}_{N_R}-{\mathbf{Z}}^{\mathrm{H}}\mathbf{Z}\right)}^{1/2}+\mathbf{S}\mathbf{Z}\right]\mathbf{R}=\widehat{\mathbf{D}}\mathbf{A}+\mathbf{S}\mathbf{B}, $$
(4)
where \( \mathbf{R}=\operatorname{diag}\left(\sqrt{\varLambda_1},\sqrt{\varLambda_2},\dots, \sqrt{\varLambda_K}\right) \) and Z = diag(Z 1, Z 2, …, Z K ) and Λ k is a diagonal matrix that consists of n r non-zero eigenvalues of \( {\mathbf{D}}_k{\mathbf{D}}_k^{\mathrm{H}} \). \( \mathbf{A}={\left({\mathbf{I}}_{N_R}-{\mathbf{Z}}^{\mathrm{H}}\mathbf{Z}\right)}^{1/2}\mathbf{R} \) and B = ZR.
The achievable rate of the kth UT can be expressed as
$$ \begin{array}{l} R= E\left[{ \log}_2\frac{\left|{\mathbf{I}}_{N_R}+{\displaystyle \sum_{i=1}^K{\mathbf{D}}_k^{\mathrm{H}}{\mathbf{W}}_i{\mathbf{W}}_i^{\mathrm{H}}{\mathbf{D}}_k}\right|}{\left|{\mathbf{I}}_{N_R}+{\displaystyle \sum_{i=1, i\ne k}^K{\mathbf{D}}_k^{\mathrm{H}}{\mathbf{W}}_i{\mathbf{W}}_i^{\mathrm{H}}{\mathbf{D}}_k}\right|}\right]\hfill \\ {}\kern0.6em = E\left[{ \log}_2\left|{\mathbf{I}}_{N_R}+{\displaystyle \sum_{i=1}^K{\mathbf{D}}_k^{\mathrm{H}}{\mathbf{W}}_i{\mathbf{W}}_i^{\mathrm{H}}{\mathbf{D}}_k}\right|\right]-\hfill \\ {}\kern1.08em E\left[{ \log}_2\left|{\mathbf{I}}_{N_R}+{\displaystyle \sum_{i=1, i\ne k}^K{\mathbf{D}}_k^{\mathrm{H}}{\mathbf{W}}_i{\mathbf{W}}_i^{\mathrm{H}}{\mathbf{D}}_k}\right|\right].\hfill \end{array} $$
(5)

3.2 Linear precoder design

The precoders can be designed to alleviate multiuser interference, maximize the received desired signal power, or minimize the MSE of the received signals. We in the following will take the MMSE precoder as an example. Then, MMSE cost function can be defined as [15]
$$ \begin{array}{l}\underset{\beta, \mathbf{W}}{ \min}\kern0.5em E\left({\left\Vert \mathbf{x}-{\beta}^{-1}\mathbf{y}\right\Vert}_F^2\right)\hfill \\ {}\operatorname{s}. t.\kern0.5em E\left({\left\Vert \mathbf{W}\mathbf{x}\right\Vert}_F^2\right)\le {P}_T\hfill \end{array}. $$
(6)
Substituting (4) into (6), the conditional expectation becomes
$$ \begin{array}{l}\mathrm{E}\left({\left\Vert \mathrm{x}-{\beta}^{-1}\mathbf{y}\right\Vert}_F^2\right)\hfill \\ {}={E}_{\mathbf{A},\mathbf{B},\mathbf{x}}\left({\left\Vert \mathbf{x}-{\beta}^{-1}{\mathbf{A}}^{\mathrm{H}}{\widehat{\mathbf{D}}}^{\mathrm{H}}\mathbf{W}\mathbf{x}-{\beta}^{-1}{\mathbf{B}}^{\mathrm{H}}{\mathbf{S}}^{\mathrm{H}}\mathbf{W}\mathbf{x}-{\beta}^{-1}\mathbf{n}\right\Vert}_F^2\right)\hfill \\ {}={\beta}^{-2}{E}_{\mathbf{A}}\left[\operatorname{tr}\left({\mathbf{W}}^{\mathrm{H}}\widehat{\mathbf{D}}\mathbf{A}{\mathbf{A}}^{\mathrm{H}}{\widehat{\mathbf{D}}}^{\mathrm{H}}\mathbf{W}\right)\right]\hfill \\ {}\kern0.48em +{\beta}^{-2}{E}_{\mathbf{B},\mathbf{S}}\left[\operatorname{tr}\left({\mathbf{W}}^{\mathrm{H}}\mathbf{SB}{\mathbf{B}}^{\mathrm{H}}{\mathbf{S}}^{\mathrm{H}}\mathbf{W}\right)\right]+\left({\beta}^{-2}+1\right){\left\Vert {\mathbf{I}}_{N_R}\right\Vert}_F^2\hfill \\ {}\kern0.48em -{\beta}^{-1}{E}_{\mathbf{A}}\left[\operatorname{tr}\left({\mathbf{W}}^{\mathrm{H}}\widehat{\mathbf{D}}\mathbf{A}\right)\right]-{\beta}^{-1}{E}_{\mathbf{A}}\left[\operatorname{tr}\left({\mathbf{A}}^{\mathrm{H}}{\widehat{\mathbf{D}}}^{\mathrm{H}}\mathbf{W}\right)\right]\hfill \end{array} $$
(7)
The first term in (7) can be further calculated as
$$ \begin{array}{l}{\beta}^{-2}{E}_{\mathbf{A}}\left[\operatorname{tr}\left({\mathbf{W}}^{\mathrm{H}}\widehat{\mathbf{D}}\mathbf{A}{\mathbf{A}}^{\mathrm{H}}{\widehat{\mathbf{D}}}^{\mathrm{H}}\mathbf{W}\right)\right]\hfill \\ {}={\beta}^{-2}{E}_{\mathbf{R},\mathbf{Z}}\left[\operatorname{tr}\left(\mathbf{R}\left({\mathbf{I}}_{N_R}-\mathbf{Z}{\mathbf{Z}}^{\mathrm{H}}\right){\mathbf{W}}^{\mathrm{H}}\widehat{\mathbf{D}}{\widehat{\mathbf{D}}}^{\mathrm{H}}\mathbf{W}\right)\right]\hfill \\ {}\hfill \\ {}={\beta}^{-2}\left({N}_T-\frac{N_T\varDelta}{N_R}\right)\operatorname{tr}\left({\mathbf{W}}^{\mathrm{H}}\widehat{\mathbf{D}}{\widehat{\mathbf{D}}}^{\mathrm{H}}\mathbf{W}\right),\hfill \end{array} $$
(8)
where \( E\left[\mathbf{R}{\mathbf{R}}^{\mathrm{H}}\right]= E\left[\operatorname{diag}\left\{{\varLambda}_1,{\varLambda}_2,\dots, {\varLambda}_K\right\}\right]={N}_T{\mathbf{I}}_{N_R}, \) \( E\left[\mathbf{Z}{\mathbf{Z}}^{\mathrm{H}}\right]=\frac{\varDelta}{N_R}{\mathbf{I}}_{N_R}. \) Here, Δ denotes the quantization error that can be approximated as [16]
$$ \varDelta =\frac{\varGamma \left(\frac{1}{T}\right)}{T}{\varPhi}^{-\frac{1}{T}}{2}^{-\frac{B}{T}}, $$
(9)
where T = n r (N T  − n r ) and \( \varPhi =\frac{1}{T!}{\displaystyle \prod_{m=1}^{n_r}\frac{\left({N}_T- m\right)!}{\left({n}_r- m\right)!}} \). Γ() denotes gamma function.
The second item in (7) can also be calculated as
$$ \begin{array}{l}{\beta}^{-2}{E}_{\mathbf{B},\mathbf{S}}\left[\operatorname{tr}\left({\mathbf{W}}^{\mathrm{H}}\mathbf{SB}{\mathbf{B}}^{\mathrm{H}}{\mathbf{S}}^{\mathrm{H}}\mathbf{W}\right)\right]\hfill \\ {}\hfill \\ {}={\beta}^{-2}{P}_T\left(\frac{N_T\varDelta}{N_T-{n}_r}\right)-{\beta}^{-2}\left(\frac{N_T{n}_r\varDelta}{N_R\left({N}_T-{n}_r\right)}\right).\hfill \end{array} $$
(10)
By substituting (8) and (10) into (7), the optimization problem can be rewritten by
$$ \begin{array}{l} E\left({\left\Vert \mathbf{x}-{\beta}^{-1}\mathbf{y}\right\Vert}_F^2\right)\hfill \\ {}={\beta}^{-2}\left({N}_T-\frac{N_T^2\varDelta}{N_R\left({N}_T-{n}_r\right)}\right)\operatorname{tr}\left({\mathbf{W}}^{\mathrm{H}}\widehat{\mathbf{D}}{\widehat{\mathbf{D}}}^{\mathrm{H}}\mathbf{W}\right)\hfill \\ {}+\frac{\beta^{-2}{N}_T\varDelta}{N_T-{n}_r}+\left({\beta}^{-2}+1\right){N}_R-2\alpha {\beta}^{-1}\mathrm{Re}\left[\operatorname{tr}\left({\mathbf{W}}^{\mathrm{H}}\widehat{\mathbf{D}}\right)\right],\hfill \\ {} F\left(\mathbf{W},\beta \right)\hfill \end{array} $$
(11)

where \( \alpha {\mathbf{I}}_{N_R}= E\left[\mathbf{A}\right]= E\left[{\left({\mathbf{I}}_{N_R}-{\mathbf{Z}}^{\mathrm{H}}\mathbf{Z}\right)}^{1/2}\mathbf{R}\right]. \)

Therefore, the optimization problem in (6) is equivalent to
$$ \begin{array}{l}\underset{\beta, \mathbf{W}}{ \min}\kern0.5em F\left(\mathbf{W},\beta \right)\hfill \\ {}\operatorname{s}. t.\kern0.5em \operatorname{tr}\left({\mathbf{W}}^{\mathrm{H}}\mathbf{W}\right)\le {P}_T\hfill \end{array}. $$
(12)
Obviously, problem (12) is a convex optimization problem. Hence, problem (12) can be solved with a closed-form solution by exploiting the Karush-Kuhn-Tucker (KKT) conditions [17]. Constructing the Lagrangian function, we have
$$ L\left(\mathbf{W},\beta, \lambda \right)= F\left(\mathbf{W},\beta \right)+\lambda \left[\operatorname{tr}\left({\mathbf{W}}^{\mathrm{H}}\mathbf{W}\right)-{P}_T\right]. $$
(13)
The optimal solution to W can be calculated by taking the first-order derivative of (13) with respect to W and setting it to zero, i.e., \( \frac{\partial L\left(\mathbf{W},\beta, \lambda \right)}{\partial \mathbf{W}}=0. \) We can easily get
$$ \mathbf{W}=\rho {\left(\widehat{\mathbf{D}}{\widehat{\mathbf{D}}}^{\mathrm{H}}+\eta {\mathbf{I}}_{N_R}\right)}^{-1}\widehat{\mathbf{D}}, $$
(14)

where \( \rho =\sqrt{\frac{P_T}{\rho {\left(\widehat{\mathbf{D}}{\widehat{\mathbf{D}}}^{\mathrm{H}}+\eta {\mathbf{I}}_{N_R}\right)}^{-1}\widehat{\mathbf{D}}}} \) (ρ is normalized power factor) and \( \eta =\frac{P_T{N}_T\varDelta +{N}_R\left({N}_T-{n}_r\right)}{P_T\left[\left({N}_T-{n}_r\right)-{N}_T^2\varDelta \right]}. \)

Updating the Lagrange multiplier λ, we have
$$ \lambda \left( t+1\right)={\left[\lambda (t)+{a}_1\left(\operatorname{tr}\left({\mathbf{W}}^{\mathrm{H}}\mathbf{W}\right)-{P}_T\right)\right]}^{+}, $$
(15)
where [X]+ = max{X, 0}. a 1 is the step size which is positive and t is the step time.
  • (1) If Δ = 0, that is perfect CSI. Here, \( \eta =\frac{N_R}{P_T} \). The precoding matrix can be rewritten as

  • $$ \mathbf{W}=\rho {\left(\widehat{\mathbf{D}}{\widehat{\mathbf{D}}}^{\mathrm{H}}+\eta {\mathbf{I}}_{N_R}\right)}^{-1}\widehat{\mathbf{D}} $$
    (16)
  • (2) If Δ ≠ 0, that is imperfect CSI. Here, n r  = 1 and N T  = N R  = K for simplicity, \( \varDelta =\frac{N_T-1}{N_T}{2}^{-\frac{B}{N_T-1}}. \). The precoding matrix can be rewritten as

  • $$ \mathbf{W}=\rho {\left[\widehat{\mathbf{D}}{\widehat{\mathbf{D}}}^{\mathrm{H}}+\frac{P_T{2}^{-\frac{B}{N_T-1}}+{N}_T}{P_T\left(1-{N}_T{2}^{-\frac{B}{N_T-1}}\right)}{\mathbf{I}}_{N_R}\right]}^{-1}\widehat{\mathbf{D}}. $$
    (17)

Here, we use the sub-gradient algorithm to solve the problem. Using a constant step length t 1 and t 2, the sub-gradient algorithm can converge to the optimal point of convex problems within a small range.

To summarize, the procedure of the sub-gradient algorithm based on updating (15) is shown in Table 1.
Table 1

The proposed sub-gradient algorithm

Since MMSE function in (12) is convex on a single precoder W, updating W at each iteration monotonically reduces the MMSE in (12), which is lower bounded by zero. Algorithm 1 can converge to the optimal point of the problem (6) within a small range. Although the precoder design depends on inaccurate CSI feedback, it may not always satisfy the transmit power constraint. However, we can assume a procedure that a feedforward link exists between UTs and BS. Each UT sends information from the precoder W to the BS via the feedforward link, then BS estimates the received power to satisfy the transmit power constraint.

3.3 Analysis of computational complexity

In this subsection, we analyze the computational complexity of the proposed precoder and compare it to the complexity of ZF precoder. We express the computational complexity in terms of the number of floating point operations (FLOPs). Following [18], the complexity of our proposed scheme can be calculated as
$$ \tau \left[\left( K+1\right)\left(2 K-1\right){N}_T+\left(2{N}_T-1\right) K\right], $$
(18)
where τ is the number of transmit symbols per user, K is the number of UTs, and N T is the transmit antennas at BS. As the simplest precoding scheme, the computational complexity of the ZF precoder can be calculated as τN T (2K − 1) FLOPs.

4 Simulation results

In this section, the performance of the proposed scheme is evaluated by a computer simulation. In our simulations, the elements of all the signaling channel matrices are assumed to be i.i.d. complex Gaussian variables with zero means and unit variance. We assume that the number of UTs is K = 30, the total transmit power is P T  = 20 dB, and the background noise is σ 2 = 1.

For simplicity, we assume that the received number of antennas at each UT is n r  = 1.

Figure 2 depicts the effect of the number of antennas on the sum rate of the proposed algorithm with K = 6. As shown in Fig. 2, the sum rate increases with the increasing of the number of transmit antennas. It is observed that when the number of transmit antennas is more than 250, the sum rate gradually trends to saturation.
Fig. 2

Sum rate versus the number of transmit antennas N T

Figure 3 shows the sum rate as a function of the number of UTs under perfect CSI and limited feedback. It is observed that the sum rate increases as the number of the number of UTs increases. Clearly, there is a narrow gap between the proposed limited feedback scheme and perfect CSI.
Fig. 3

Sum rate versus the number of UTs K

Figure 4 shows the sum rate performance of different schemes under increasing number of feedback bits B under transmit antennas N T  = 160 and n r  = 1. We take the traditional BD-ZF and conventional MMSE (C-MMSE) into comparison. It is clearly observed that our proposed scheme achieves a higher sum rate than other schemes, expect for perfect transmit CSI. We also find that the proposed scheme overcomes the sum rate degradation problem at high-SNR regions that the C-MMSE scheme has encountered.
Fig. 4

Performance comparison of the proposed scheme with different schemes under B = 6 bit and B = 16 bit

5 Conclusions

In this paper, we investigated the problem of linear precoding design for massive MIMO system in a single cell based on MMSE criteria under transmit power constraint. The proposed scheme was robust to the uncertainties in the CSI as it taken into account the effect of quantization errors and noise term. Simulation results show the superiority of our proposed quantization scheme. In the future work, we plan to study the partial feedback of CSI for multicell massive MIMO systems.

Declarations

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 (http://creativecommons.org/licenses/by/4.0/), 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

(1)
Department of Information Engineering, Chongqing Youth Vocational and Technical College
(2)
Department of Police Management Railway Police College

References

  1. C Lim, T Yoo, B Clerckx, B Lee, B Shim, Recent trend of multiuser MIMO in LTE-Advanced. IEEE Commun. Mag. 51(3), 127–135 (2013)View ArticleGoogle Scholar
  2. D Gesbert, M Kountouris, RW Heath, C-B Chae, T Sälzer, Shifting the MIMO paradigm. IEEE Signal Process. Mag. 24(5), 36–46 (2007)View ArticleGoogle Scholar
  3. N Jindal, MIMO broadcast channels with finite-rate feedback. IEEE Trans. Inf. Theory 52(11), 5045–5060 (2006)MathSciNetView ArticleMATHGoogle Scholar
  4. TL Marzetta, Noncooperative cellular wireless with unlimited numbers of base station antennas. IEEE Trans. Wirel. Commun. 9(11), 3590–3600 (2010)View ArticleGoogle Scholar
  5. L Lu, GY Li, AL Swindlehurst, A Ashikhmin, R Zhang, An overview of massive MIMO: benefits and challenges. IEEE J. Sel. Areas Commun. 8(5), 742–758 (2014)Google Scholar
  6. F Boccardi, RW Heath Jr, A Lozano, TL Marzetta, P Popovski, Five disruptive technology directions for 5G. IEEE Commun. Mag. 52(2), 74–80 (2014)View ArticleGoogle Scholar
  7. MH Costa, Writing on dirty paper (corresp.). IEEE Trans. Inf. Theory 29(3), 439–441 (1983)MathSciNetView ArticleMATHGoogle Scholar
  8. H Prabhu, J Rodrigues, O Edfors, F Rusek, Approximative Matrix Inverse Computations for Very-Large MIMO and Applications to Linear Pre-coding Systems (Proceedings of IEEE Wireless Communications and Networking Conference (WCNC), Shanghai, China, 2013), pp. 2710–2715. April 7–10Google Scholar
  9. JC Chen, CJ Wang, KK Wong, et al., Low-complexity precoding design for massive multiuser MIMO systems using approximate message passing. IEEE Trans. Vehicular Technol. 65(7), 5707–5714 (2016)
  10. T Xie, Q Han, H Xu, Z Qi, W Shen, A Low-Complexity Linear Precoding Scheme Based on SOR Method for Massive MIMO Systems (Proceedings of the 81st IEEE Vehicular Technology Conference (VTC-Spring), Glasgow, 2015), pp. 1–5. May 11–14Google Scholar
  11. T Yoo, N Jindal, A Goldsmith, Multi-antenna downlink channels with limited feedback and user selection. IEEE J. Sel. Areas Commun. 25(7), 1478–1491 (2007)View ArticleGoogle Scholar
  12. LY Song, Z Han, ZS Zhang, BL Jiao, Non-cooperative feedback-rate control game for channel state information in wireless networks. IEEE J. Sel. Areas Commun. 30(1), 188–197 (2012)View ArticleGoogle Scholar
  13. J-H Noh, S-J Oh, Beamforming in a multi-user cognitive radio system with partial channel state information. IEEE Trans. Wirel. Commun. 12(2), 616–625 (2013)View ArticleGoogle Scholar
  14. N Ravindran, N Jindal, Multi-user diversity vs. accurate channel state information in MIMO downlink channels. IEEE Trans. Wirel. Commun. 11(9), 201–220 (2012)View ArticleGoogle Scholar
  15. K-J Lee, I Lee, MMSE based block diagonalization for cognitive radio MIMO broadcast channels. IEEE Trans. Wirel. Commun. 10(10), 3139–3144 (2011)View ArticleGoogle Scholar
  16. N Ravindran, N Jindal, Limited feedback-based block diagonalization for the MIMO broadcast channel. IEEE J. Sel. Areas Commun. 26(8), 1473–1482 (2008)View ArticleGoogle Scholar
  17. S Boyd, L Vandenberghe, Convex Optimization (Cambridge Univ. Press, Cambridge, U.K., 2004)View ArticleMATHGoogle Scholar
  18. C Guthy, W Utschick, R Hunger, et al., Weighted sum rate maximization in the MIMO MAC with linear transceivers: algorithmic solutions Asilomar Conference on. IEEE Xplore. 2009, 1528–1532

Copyright

© The Author(s). 2017