Research Article
Design of Group Precoding for MU-MIMO Systems with Exponential Spatial Correlation Channel
@ARTICLE{10.4108/eai.26-1-2021.168228, author={Van-Khoi Dinh and Thanh-Binh Chu and Minh-Tuan Le and Vu-Duc Ngo}, title={Design of Group Precoding for MU-MIMO Systems with Exponential Spatial Correlation Channel}, journal={EAI Endorsed Transactions on Industrial Networks and Intelligent Systems}, volume={8}, number={26}, publisher={EAI}, journal_a={INIS}, year={2021}, month={1}, keywords={MU-MIMO system, linear precoding algorithms, lattice reduction algorithms}, doi={10.4108/eai.26-1-2021.168228} }
- Van-Khoi Dinh
Thanh-Binh Chu
Minh-Tuan Le
Vu-Duc Ngo
Year: 2021
Design of Group Precoding for MU-MIMO Systems with Exponential Spatial Correlation Channel
INIS
EAI
DOI: 10.4108/eai.26-1-2021.168228
Abstract
In this paper, a low-complexity precoding algorithm is proposed to reduce the computational complexity and improve the performance for MU-MIMO systems under exponential spatial correlation channel conditions. The proposed precoders are designed consisting of two components: The first one minimizes the interference among neighboring user groups, while the second one improves the system performance. Numerical and simulation results show that the proposed precoders have remarkably lower computational complexities than their existing LC-RBD-LR-ZF and BD counterparts. Besides, BER performances of the proposed precoders are asymptotic to that of LC-RBD-LR-ZF precoder at the low SNR region and better than that of LC-RBD-LR-ZF precoder at the high SNR region. Simulation results also show that the performance of the proposed algorithms is significantly improved compared to the BD algorithm in an exponential spatial correlation channel.
Copyright © 2021 Van-Khoi Dinh et al., licensed to EAI. This is an open access article distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/3.0/), which permits unlimited use, distribution and reproduction in any medium so long as the original work is properly cited.