Low-Complexity Joint Antenna and User Selection Scheme for the Downlink Multiuser Massive MIMO System with Complexity Reduction Factors

Aye Mon HTUN  Maung SANN MAW  Iwao SASASE  

IEICE TRANSACTIONS on Communications   Vol.E102-B   No.3   pp.592-602
Publication Date: 2019/03/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.2018EBP3122
Type of Manuscript: PAPER
Category: Wireless Communication Technologies
massive MIMO,  joint antenna and user selection,  complexity,  singular value decomposition,  block diagonalization,  

Full Text: PDF(1.2MB)>>
Buy this Article

Multiuser massive multi-input multi-output (MU massive MIMO) is considered as a promising technology for the fifth generation (5G) of the wireless communication system. In this paper, we propose a low-complexity joint antenna and user selection scheme with block diagonalization (BD) precoding for MU massive MIMO downlink channel in the time division duplex (TDD) system. The base station (BS) is equipped with a large-scale transmit antenna array while each user is using the single receive antenna in the system. To reduce the hardware cost, BS will be implemented by limited number of radio frequency (RF) chains and BS must activate some selected transmit antennas in the BS side for data transmitting and some users' receive antennas in user side for data receiving. To achieve the reduction in the computation complexity in the antenna and user selection while maintaining the same or higher sum-rate in the system, the proposed scheme relies on three complexity reduction key factors. The first key factor is that finding the average channel gains for the transmit antenna in the BS side and the receive antenna in the user side to select the best channel gain antennas and users. The second key factor called the complexity control factor ξ(Xi) for the antenna set and the user set limitation is used to control the complexity of the brute force search. The third one is that using the assumption of the point-to-point deterministic MIMO channel model to avoid the singular value decomposition (SVD) computation in the brute force search. We show that the proposed scheme offers enormous reduction in the computation complexity while ensuring the acceptable performance in terms of total system sum-rate compared with optimal and other conventional schemes.