Capacity Scaling Law in Massive MIMO with Antenna Selection
Chongjun Ouyang, Hao Xu, Xujie Zang, and Hongwen Yang

TL;DR
This paper analyzes the sum-rate capacity of massive MIMO uplink channels with antenna selection under Nakagami fading, deriving bounds and showing capacity growth is double logarithmic with the number of antennas.
Contribution
It introduces a mathematically tractable sum-rate capacity upper bound and a deterministic equivalent for massive MIMO with antenna selection, revealing double logarithmic growth.
Findings
Sum-rate capacity grows double logarithmically with the number of BS antennas.
Derived a capacity upper bound for massive MIMO with antenna selection.
Confirmed analytical results through numerical experiments.
Abstract
Antenna selection is capable of handling the cost and complexity issues in massive multiple-input multiple-output (MIMO) channels. The sum-rate capacity of a multiuser massive MIMO uplink channel is characterized under the Nakagami fading. A mathematically tractable sum-rate capacity upper bound is derived for the considered system. Moreover, for a sufficiently large base station (BS) antenna number, a deterministic equivalent (DE) of the sum-rate bound is derived. Based on this DE, the sum-rate capacity is shown to grow double logarithmically with the number of BS antennas. The validity of the analytical result is confirmed by numerical experiments.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced MIMO Systems Optimization · Cooperative Communication and Network Coding · Antenna Design and Analysis
