Computer Science – Information Theory
Scientific paper
2011-07-08
Computer Science
Information Theory
6 pages, 3 figures, to be presented at the Allerton Conference on Communication, Control and Computing, Urbana-Champaign, Illi
Scientific paper
We consider a multicell MIMO uplink channel where each base station (BS) is equipped with a large number of antennas N. The BSs are assumed to estimate their channels based on pilot sequences sent by the user terminals (UTs). Recent work has shown that, as N grows infinitely large, (i) the simplest form of user detection, i.e., the matched filter (MF), becomes optimal, (ii) the transmit power per UT can be made arbitrarily small, (iii) the system performance is limited by pilot contamination. The aim of this paper is to assess to which extent the above conclusions hold true for large, but finite N. In particular, we derive how many antennas per UT are needed to achieve \eta % of the ultimate performance. We then study how much can be gained through more sophisticated minimum-mean-square-error (MMSE) detection and how many more antennas are needed with the MF to achieve the same performance. Our analysis relies on novel results from random matrix theory which allow us to derive tight approximations of achievable rates with a class of linear receivers.
Brink Stephan ten
Debbah Merouane
Hoydis Jakob
No associations
LandOfFree
Massive MIMO: How many antennas do we need? does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Massive MIMO: How many antennas do we need?, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Massive MIMO: How many antennas do we need? will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-222780