Professional Documents
Culture Documents
AbstractFor massive MIMO system with hundreds of anten- precoding based on Neumann series approximation algorithm
nas at the base station (BS), zero forcing (ZF) precoding can was proposed recently [9]. The Neumann-based precoding can
achieve the near-optimal capacity due to the asymptotically or- reduce the complexity by converting the matrix inversion into a
thogonal channel, but it involves complicated matrix inversion of
large size. In this paper, we propose a Richardson Method (RM) series of matrix-vector multiplications. However, the reduction
based precoding to avoid the complicated matrix inversion in an in complexity is not obvious.
iterative way, which can reduce the complexity by one order of In this paper, we propose a near-optimal linear precoding
magnitude. We also prove that the optimal relaxation parameter based on the Richardson Method (RM) [10] for massive
to RM can be approached by a simple and quantified value to
MIMO. The proposed RM-based precoding can precode the
maximize the convergence rate of RM-based precoding, which
only depends on the number of BS antennas and the number transmitted signal in an simple iterative way which can avoid
of users. Simulation results show that RM-based precoding can the complicated matrix inversion of large-size. We also prove
achieve the near-optimal performance of ZF precoding with only that the optimal relaxation parameter to RM can be approached
a small number of iterations. by a simple and quantified value, which only depends on the
MIMO configuration (i.e., the number of BS antennas and the
I. I NTRODUCTION number of users), to maximize the convergence rate of RM-
where f is the downlink signal-to-noise ratio (SNR), where the superscript i denotes the number of iterations, s(0)
H CKN is Rayleigh fading channel matrix, which can is the initial solution, which can be usually selected as the
be usually achieved by time-domain and/or frequency-domain zero-vector due to no a prior information is available [19],
training pilots [11][16], n of size K 1 is the additive [20], is the relaxation parameter, which plays an important
white Gaussian noise (AWGN) vector, whose entries follow role in the convergence and convergence rate. It has been
CN (0, 1), t = Ps is the N 1 signal vector for actual trans- proved that when matrix W is Hermitian positive definite
2
mission after precoding, where P is the N K precoding and 0 < < max , where max is the largest eigenvalue of
matrix, s of size K 1 is the original signal for all K users matrix W, RM-based precoding is convergent for any initial
to be transmitted. solutions [10]. The impact of relaxation parameter on the
The classical ZF precoding is a scheme by which BS convergence rate will be discussed in the following sub-
can completely eliminate the multiuser interferences. The ZF section. Note that after the final solution s(i+1) is obtained,
precoding matrix PZF can be presented as [6] the precoded signal vector for transmission can be achieved
by
PZF = H , (2) t = HH s(i+1) . (5)
H H 1 H 1
where H = H (HH ) = H W denotes the pseudo-
of the channel
inversion matrix H, here we define W=HHH , B. Selection of the optimal relaxation parameter
K
ZF = tr(W 1 ) N K [17] is the normalized parame- In this part, we will first analyze the approximation error
ter to average the fluctuations in transmit power. The precoded induced by RM, which can be presented as
signal vector t for transmission can be obtained as
s(i+1) s = B s(i) s = = Bi+1 s(0) s , (6)
t = HH W1 s = HH s, (3)
where B = IK W is the iteration matrix of RM. The
where we define s = W1 s.
approximation error can be evaluated as
For downlink massive MIMO systems, it has been verified
(i+1)
that ZF precoding can achieve the capacity close to the optimal s s = Bi+1 F s(0) s , (7)
DPC precoding [6]. However, the ZF precoding involves 2 2
matrix inversion W1 of large size, and the computational which means that the final approximation
error induced by
complexity of W1 is O(K 3 ), including a large number of RM is mainly affected by B(i+1) . However, the direct
F
division operations, which is high since K is usually large in computation of B(i+1) F is complicated, since the iteration
massive MIMO systems. matrix B is a random matrix and it is hard to obtain the joint
distribution of all the elements. Fortunately, it has been proved
III. L OW-C OMPLEXITY L INEAR P RECODING S CHEME F OR in [10] that when i go infinity, we have the following equation
M ASSIVE MIMO 1/(i+1)
In this section, we propose a RM-based precoding scheme lim B(i+1) = (B) , (8)
i F
with low complexity. After that, the convergence rate and the
selection of the optimal relaxation parameter involved in RM where (B) = max |n | and n are the spectral radius and
1nK
is analyzed. Finally, we provide the complexity analysis of the nth eigenvalue of iteration matrix B, respectively. (8)
the proposed scheme to show its advantages over the recently implies that we can regard (B) as the asymptotic conver-
proposed Neumann-based precoding scheme. gence rate of RM, and a smaller (B) will lead to a faster
convergence rate.
A. RM-based precoding scheme According to the definition B = IK W, the spectral
radius (B) will depend on the relaxation parameter as
Although calculating W1 involves high complexity as
mentioned above, fortunately, the special properties of massive (B) = max {|1 max | , |1 min |} , (9)
TABLE I
0.035 Optimal relaxation parameter
C OMPLEXITY C OMPARISON
Quantified relaxation parameter Iterative Neumann-based Proposed RM-based
number precoding [9] precoding
0.03
i=2 2K 2 K 2K 2 + 2K
i=3 K3 3K 2 + 3K
Relaxation paramter
0.025 i=4 2K 3 K 2 4K 2 + 4K
i=5 3K 3 2K 2 5K 2 + 5K
0.02
Capacity (bps/Hz)
Capacity (bps/Hz)
ZF precoding 300
ZF precoding
DPC precoding
160 DPC precoding
250
140
200
120
150
100
100
80
60 50
0 5 10 15 20 25 30 0 5 10 15 20 25 30
SNR (dB) SNR (dB)
Fig. 3. Capacity comparison between Neumann-based precoding and RM- Fig. 4. Capacity comparison between Neumann-based precoding and RM-
based precoding for the 256 16 massive MIMO system. based precoding for the 256 32 massive MIMO system.
Fig. 4 shows the achievable channel capacity [5] L. Dai, Z. Wang, and Z. Yang, Spectrally efficient time-frequency
training OFDM for mobile large-scale MIMO systems, IEEE J. Sel.
comparison between the two precoding schemes when Areas Commun., vol. 31, no. 2, pp. 251263, Feb. 2013.
N K = 256 32. Comparing Fig. 3 and Fig. 4, we can [6] F. Rusek, D. Persson, B. K. Lau, E. G. Larsson, T. L. Marzetta,
find that with a decreasing value of = N/K, the gain O. Edfors, and F. Tufvesson, Scaling up MIMO: Opportunities and
challenges with very large arrays, IEEE Signal Process. Mag., vol. 30,
achieved by RM-based precoding compared to Neumann- no. 1, pp. 4060, Jan. 2013.
based precoding is more obvious. For example, when i = 4 [7] M. H. Costa, Writing on dirty paper (corresp.), IEEE Trans. Inf.
and SNR = 30 dB, for 256 16 MIMO system, RM-based Theory, vol. 29, no. 3, pp. 439441, Mar. 1983.
[8] J. H. Lee, Lattice precoding and pre-distorted constellation in degraded
precoding enjoys 5 bps/Hz gain compared to Neumann-based broadcast channel with finite input alphabets, IEEE Trans. Commun.,
precoding, while for 256 32 MIMO system, the gain vol. 58, no. 5, pp. 13151320, May 2010.
achieved by RM-based precoding is increased to 40 bps/Hz. [9] H. Prabhu, J. Rodrigues, O. Edfors, and F. Rusek, Approximative
matrix inverse computations for large-scale MIMO and applications to
Moreover, when the number of iterations is relatively large linear pre-coding systems, in Proc. IEEE Wireless Communications and
(e.g., i = 5 in Fig. 3), the proposed RM-based precoding Networking Conference (WCNC13), Apr. 2013, pp. 27102715.
without the complicated matrix inversion can approach the [10] A. Bjorck, Numerical methods in matrix computations, Texts in
Applied Mathematics, 2015.
channel capacity of the optimal DPC precoding with negligi- [11] L. Dai, J. Wang, Z. Wang, P. Tsiaflakis, and M. Moonen, Spectrum-
ble performance loss. More importantly, considering the low and energy-efficient OFDM based on simultaneous multi-channel recon-
complexity of RM-based precoding as shown in Table I, we struction, IEEE Trans. Signal Process., vol. 61, no. 23, pp. 60476059,
Dec. 2013.
can conclude that the proposed scheme achieves a much better [12] L. Dai, Z. Wang, and Z. Yang, Compressive sensing based time domain
trade-off between performance and complexity. synchronous OFDM transmission for vehicular communications, IEEE
J. Sel. Areas Commun., vol. 31, no. 9, pp. 460469, Sep. 2013.
V. C ONCLUSIONS [13] Z. Gao, L. Dai, Z. Lu, C. Yuen, and Z. Wang, Super-resolution
sparse MIMO-OFDM channel estimation based on spatial and temporal
In this paper, we propose a RM-based precoding to reduce correlations, IEEE Commun. Lett., vol. 18, no. 7, pp. 12661269, Jul.
2014.
the complexity of ZF precoding from O(K 3 ) to O(K 2 ). A [14] Z. Gao, C. Zhang, Z. Wang, and S. Chen, Priori-information aided
quantified relaxation parameter is also proposed to maximize iterative hard threshold: A low-complexity high-accuracy compressive
the convergence rate of RM-based precoding. Simulation re- sensing based channel estimation for TDS-OFDM, IEEE Trans. Wire-
less Commun., vol. 14, no. 1, pp. 242251, Jan. 2015.
sults verify that our method outperforms the recently proposed [15] Z. Gao, C. Zhang, and Z. Wang, Robust preamble design for synchro-
Neumann-based precoding, and achieves the near-optimal nization, signaling transmission and channel estimation, IEEE Trans.
performance of ZF precoding with only a small number of Broadcast., 2015.
[16] D. Mi, M. Dianati, S. Muhaidat, and Y. Chen, A novel antenna selection
iterations. scheme for spatially correlated massive MIMO uplinks with imperfect
channel estimation, in Proc. IEEE VTC13-Spring, May 2015.
R EFERENCES [17] A. M. Tulino and S. Verdu, Random matrix theory and wireless
[1] R. W. Health, A. Lozano, T. L. Marzetta, and P. Popovski, Five communications. Now Publishers Inc., 2004.
disruptive technology directions for 5G, IEEE Commun. Mag., vol. 52, [18] X. Gao, L. Dai, Y. Ma, and Z. Wang, Low-complexity near-optimal
no. 2, pp. 7480, Feb. 2014. signal detection for uplink large-scale MIMO systems, Electron. Lett.,
[2] Z. Gao, L. Dai, and Z. Wang, Structured compressive sensing based vol. 50, no. 18, pp. 13261328, Sep. 2014.
superimposed pilot design in downlink large-scale MIMO systems, [19] L. Dai, X. Gao, X. Su, S. Han, C.-L. I, and Z. Wang, Low-complexity
Electron. Lett., vol. 50, no. 12, pp. 896898, Jun. 2014. soft-output signal detection based on Gauss-Seidel method for uplink
multi-user large-scale MIMO systems, IEEE Trans. Veh. Technol., 2015.
[3] L. Dai, Z. Wang, and Z. Yang, Next-generation digital television
[20] L. Dai, Z. Wang, and Z. Yang, Time-frequency training OFDM with
terrestrial broadcasting systems: Key technologies and research trends,
high spectral efficiency and reliable performance in high speed environ-
IEEE Commun. Mag., vol. 50, no. 6, pp. 150158, Jun. 2012.
ments, IEEE J. Sel. Areas Commun., vol. 30, no. 4, pp. 695707, May
[4] H. Ngo, E. Larsson, and T. Marzetta, Energy and spectral efficiency of
2012.
very large multiuser MIMO systems, IEEE Trans. Commun., vol. 61,
no. 4, pp. 14361449, Apr. 2012.