TY - GEN
T1 - Polynomial expansion of the precoder for power minimization in large-scale MIMO systems
AU - Sifaou, Houssem
AU - Kammoun, Abla
AU - Sanguinetti, Luca
AU - Debbah, Merouane
AU - Alouini, Mohamed-Slim
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2016/7/26
Y1 - 2016/7/26
N2 - This work focuses on the downlink of a single-cell large-scale MIMO system in which the base station equipped with M antennas serves K single-antenna users. In particular, we are interested in reducing the implementation complexity of the optimal linear precoder (OLP) that minimizes the total power consumption while ensuring target user rates. As most precoding schemes, a major difficulty towards the implementation of OLP is that it requires fast inversions of large matrices at every new channel realizations. To overcome this issue, we aim at designing a linear precoding scheme providing the same performance of OLP but with lower complexity. This is achieved by applying the truncated polynomial expansion (TPE) concept on a per-user basis. To get a further leap in complexity reduction and allow for closed-form expressions of the per-user weighting coefficients, we resort to the asymptotic regime in which M and K grow large with a bounded ratio. Numerical results are used to show that the proposed TPE precoding scheme achieves the same performance of OLP with a significantly lower implementation complexity. © 2016 IEEE.
AB - This work focuses on the downlink of a single-cell large-scale MIMO system in which the base station equipped with M antennas serves K single-antenna users. In particular, we are interested in reducing the implementation complexity of the optimal linear precoder (OLP) that minimizes the total power consumption while ensuring target user rates. As most precoding schemes, a major difficulty towards the implementation of OLP is that it requires fast inversions of large matrices at every new channel realizations. To overcome this issue, we aim at designing a linear precoding scheme providing the same performance of OLP but with lower complexity. This is achieved by applying the truncated polynomial expansion (TPE) concept on a per-user basis. To get a further leap in complexity reduction and allow for closed-form expressions of the per-user weighting coefficients, we resort to the asymptotic regime in which M and K grow large with a bounded ratio. Numerical results are used to show that the proposed TPE precoding scheme achieves the same performance of OLP with a significantly lower implementation complexity. © 2016 IEEE.
UR - http://hdl.handle.net/10754/621364
UR - http://ieeexplore.ieee.org/document/7510948/
UR - http://www.scopus.com/inward/record.url?scp=84981294997&partnerID=8YFLogxK
U2 - 10.1109/ICC.2016.7510948
DO - 10.1109/ICC.2016.7510948
M3 - Conference contribution
SN - 9781479966646
BT - 2016 IEEE International Conference on Communications (ICC)
PB - Institute of Electrical and Electronics Engineers (IEEE)
ER -