Abstract

This paper investigates the performance of linear precoders in massive multiple-input multiple-output (MIMO) systems. Different from the existing research, in this paper, we consider a more realistic scenario, where the input signals are taken from finite-alphabet constellation sets, such as phase shift keying (PSK) or quadrature amplitude modulation (QAM), instead of Gaussian signals. The expressions are derived for the achievable mutual information with two commonly known linear precoders, i.e., zero forcing (ZF) and matched filter (MF), in the scenarios were perfect and imperfect channel state information (CSI) is known at the base station (BS). Also, the performance upper bound of mutual information with precoding techniques is analyzed. Both the theoretical analysis and simulation results show that ZF and MF precoders are near optimal when the number of antennas equipped at the BS is much larger than the number of users, which is similar to the case of Gaussian inputs. However, different from the Gaussian inputs, for the case of finite-alphabet inputs, the increase in the number of antennas does not always mean the improvement of performance; specifically, after the number of antennas at the BS, reaches a certain value, more antennas actually almost have no help for the performance improvement of mutual information, which is true whether the CSI is perfect or imperfect.

Highlights

  • Multiple-input multiple-output (MIMO) has been widely studied during the last two decades

  • This paper focuses on the performance of zero forcing (ZF) and matched filter (MF) precoders in multi-user massive MIMO systems

  • We investigate the performance of linear precoders in realistic massive MIMO systems with finite-alphabet inputs

Read more

Summary

INTRODUCTION

Multiple-input multiple-output (MIMO) has been widely studied during the last two decades. X. Zhu et al.: Performance Analysis of Linear Precoding in Massive MIMO Systems With Finite-Alphabet Inputs is much larger than the number of users [9]. The research on precoding for finite-alphabet inputs has been expanded to the cognitive radio networks [17], wireless power transfer systems [18], and spatial modulation MIMO systems [19] All these works show that there is a clear difference between the mutual information with Gaussian inputs and that with finite-alphabet inputs; as a result, the same precoder exhibits different performance when the inputs are Gaussian and finite-alphabet signals, respectively. Different from the Gaussian input case, the mutual information with finite-alphabet inputs exhibits an interesting property; that is, whether the CSI is perfect or imperfect, when the number of antennas reaches some certain value, further increasing the number of antennas can hardly improve the performance in spectral efficiency.

MUTUAL INFORMATION WITH FINITE-ALPHABET
M Nt M Nt
PERFORMANCE OF LINEAR PRECODERS WITH IMPERFECT CSI
SIMULATION RESULTS
PERFECT CSI CASE
CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.