289 research outputs found
Massive MIMO: How many antennas do we need?
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.Comment: 6 pages, 3 figures, to be presented at the Allerton Conference on
Communication, Control and Computing, Urbana-Champaign, Illinois, US, Sep.
201
PAR-Aware Large-Scale Multi-User MIMO-OFDM Downlink
We investigate an orthogonal frequency-division multiplexing (OFDM)-based
downlink transmission scheme for large-scale multi-user (MU) multiple-input
multiple-output (MIMO) wireless systems. The use of OFDM causes a high
peak-to-average (power) ratio (PAR), which necessitates expensive and
power-inefficient radio-frequency (RF) components at the base station. In this
paper, we present a novel downlink transmission scheme, which exploits the
massive degrees-of-freedom available in large-scale MU-MIMO-OFDM systems to
achieve low PAR. Specifically, we propose to jointly perform MU precoding, OFDM
modulation, and PAR reduction by solving a convex optimization problem. We
develop a corresponding fast iterative truncation algorithm (FITRA) and show
numerical results to demonstrate tremendous PAR-reduction capabilities. The
significantly reduced linearity requirements eventually enable the use of
low-cost RF components for the large-scale MU-MIMO-OFDM downlink.Comment: To appear in IEEE Journal on Selected Areas in Communication
Achieving "Massive MIMO" Spectral Efficiency with a Not-so-Large Number of Antennas
The main focus and contribution of this paper is a novel network-MIMO TDD
architecture that achieves spectral efficiencies comparable with "Massive
MIMO", with one order of magnitude fewer antennas per active user per cell. The
proposed architecture is based on a family of network-MIMO schemes defined by
small clusters of cooperating base stations, zero-forcing multiuser MIMO
precoding with suitable inter-cluster interference constraints, uplink pilot
signals reuse across cells, and frequency reuse. The key idea consists of
partitioning the users population into geographically determined "bins", such
that all users in the same bin are statistically equivalent, and use the
optimal network-MIMO architecture in the family for each bin. A scheduler takes
care of serving the different bins on the time-frequency slots, in order to
maximize a desired network utility function that captures some desired notion
of fairness. This results in a mixed-mode network-MIMO architecture, where
different schemes, each of which is optimized for the served user bin, are
multiplexed in time-frequency. In order to carry out the performance analysis
and the optimization of the proposed architecture in a clean and
computationally efficient way, we consider the large-system regime where the
number of users, the number of antennas, and the channel coherence block length
go to infinity with fixed ratios. The performance predicted by the large-system
asymptotic analysis matches very well the finite-dimensional simulations.
Overall, the system spectral efficiency obtained by the proposed architecture
is similar to that achieved by "Massive MIMO", with a 10-fold reduction in the
number of antennas at the base stations (roughly, from 500 to 50 antennas).Comment: Full version with appendice (proofs of theorems). A shortened version
without appendice was submitted to IEEE Trans. on Wireless Commun. Appendix B
was revised after submissio
Decentralized Massive MIMO Processing Exploring Daisy-chain Architecture and Recursive Algorithms
Algorithms for Massive MIMO uplink detection and downlink precoding typically
rely on a centralized approach, by which baseband data from all antenna modules
are routed to a central node in order to be processed. In the case of Massive
MIMO, where hundreds or thousands of antennas are expected in the base-station,
said routing becomes a bottleneck since interconnection throughput is limited.
This paper presents a fully decentralized architecture and an algorithm for
Massive MIMO uplink detection and downlink precoding based on the Stochastic
Gradient Descent (SGD) method, which does not require a central node for these
tasks. Through a recursive approach and very low complexity operations, the
proposed algorithm provides a good trade-off between performance,
interconnection throughput and latency. Further, our proposed solution achieves
significantly lower interconnection data-rate than other architectures,
enabling future scalability.Comment: Manuscript accepted for publication in IEEE Transactions on Signal
Processin
- …