Low-Complexity Channel Estimation in Large-Scale MIMO using Polynomial Expansion

Nafiseh Shariati (1) , Emil Björnson (1, 2) , Mats Bengtsson (1) , Mérouane Debbah (2)

1 KTH - KTH Royal Institute of Technology [Stockholm]
2 Chaire Radio Flexible - Chaire Radio Flexible Alcatel-Lucent/Supélec

This paper considers pilot-based channel estimation in large-scale multiple-input multiple-output (MIMO) communication systems, also known as "massive MIMO". Unlike previous works on this topic, which mainly considered the impact of inter-cell disturbance due to pilot reuse (so-called pilot contamination), we are concerned with the computational complexity. The conventional minimum mean square error (MMSE) and minimum variance unbiased (MVU) channel estimators rely on inverting covariance matrices, which has cubic complexity in the multiplication of number of antennas at each side. Since this is extremely expensive when there are hundreds of antennas, we propose to approximate the inversion by an L-order matrix polynomial. A set of low-complexity Bayesian channel estimators, coined Polynomial ExpAnsion CHannel (PEACH) estimators, are introduced. The coefficients of the polynomials are optimized to yield small mean square error (MSE). We show numerically that near-optimal performance is achieved with low polynomial orders. In practice, the order L can be selected to balance between complexity and MSE. Interestingly, pilot contamination is beneficial to the PEACH estimators in the sense that smaller L can be used to achieve near-optimal MSEs.

Domains: Information Theory [cs.IT]; Information Theory [math.IT]; Networking and Internet Architecture [cs.NI]

Nafiseh Shariati, Emil Björnson, Mats Bengtsson, Mérouane Debbah. Low-Complexity Channel Estimation in Large-Scale MIMO using Polynomial Expansion. PIMRC 2013, Sep 2013, London, United Kingdom. pp.1-6. ⟨hal-00923462⟩