
Approximate ergodic capacity of multiuser massive multiple input multiple output in a Rayleigh fading uplink channel with variance profile
Author(s) -
Kazemi Mohammad,
Aghaeinia Hassan
Publication year - 2015
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2014.0566
Subject(s) - mimo , rayleigh fading , telecommunications link , fading , base station , antenna (radio) , computer science , channel (broadcasting) , ergodic theory , channel capacity , precoding , channel state information , signal to noise ratio (imaging) , antenna array , algorithm , topology (electrical circuits) , telecommunications , mathematics , control theory (sociology) , wireless , mathematical analysis , combinatorics , control (management) , artificial intelligence
The effect of large‐scale fading variations over massive multiple input multiple output (MIMO) antenna array on sum‐capacity of massive MIMO system has not been thoroughly investigated in the literature. This study considers a multiuser massive MIMO system with a Rayleigh fading channel that takes into account large‐scale fading variations over base station antenna array. Two scenarios are investigated: distributed antenna base station and linear array base station. In both scenarios, the authors obtain an approximate closed‐form expressions for uplink ergodic sum‐capacity for both low and high signal‐to‐noise ratio (SNR) regimes. It is shown that the proposed closed‐form expressions are accurate in a wide range of practical SNRs; for example, the approximation error is below 10% for SNRs lower than −10 dB and higher than 17 dB for low‐SNR and high‐SNR closed‐form expressions, respectively. It is also shown that the proposed closed‐form expressions are not only valid for massive MIMO scenario but also for a system with a few number of base station antennas. The numerical results show that the proposed closed‐form expressions have much less computational complexity than previous works.