2,293 research outputs found
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
Designing Wireless Broadband Access for Energy Efficiency: Are Small Cells the Only Answer?
The main usage of cellular networks has changed from voice to data traffic,
mostly requested by static users. In this paper, we analyze how a cellular
network should be designed to provide such wireless broadband access with
maximal energy efficiency (EE). Using stochastic geometry and a detailed power
consumption model, we optimize the density of access points (APs), number of
antennas and users per AP, and transmission power for maximal EE. Small cells
are of course a key technology in this direction, but the analysis shows that
the EE improvement of a small-cell network saturates quickly with the AP
density and then "massive MIMO" techniques can further improve the EE.Comment: Published at Small Cell and 5G Networks (SmallNets) Workshop, IEEE
International Conference on Communications (ICC), 6 pages, 5 figures, 1 tabl
Multicell MIMO Communications Relying on Intelligent Reflecting Surfaces
Intelligent reflecting surfaces (IRSs) constitute a disruptive wireless communication technique capable of creating a controllable propagation environment. In this paper, we propose to invoke an IRS at the cell boundary of multiple cells to assist the downlink transmission to cell-edge users, whilst mitigating the inter-cell interference, which is a crucial issue in multicell communication systems. We aim for maximizing the weighted sum rate (WSR) of all users through jointly optimizing the active precoding matrices at the base stations (BSs) and the phase shifts at the IRS subject to each BS’s power constraint and unit modulus constraint. Both the BSs and the users are equipped with multiple antennas, which enhances the spectral efficiency by exploiting the spatial multiplexing gain. Due to the nonconvexity of the problem, we first reformulate it into an equivalent one, which is solved by using the block coordinate descent (BCD) algorithm, where the precoding matrices and phase shifts are alternately optimized. The optimal precoding matrices can be obtained in closed form, when fixing the phase shifts. A pair of efficient algorithms are proposed for solving the phase shift optimization problem, namely the Majorization-Minimization (MM) Algorithm and the Complex Circle Manifold (CCM) Method. Both algorithms are guaranteed to converge to at least locally optimal solutions. We also extend the proposed algorithms to the more general multiple-IRS and network MIMO scenarios. Finally, our simulation results confirm the advantages of introducing IRSs in enhancing the cell-edge user performance
- …