Search arXivSearch

arXiv · 1607.01896

Cell-Edge-Aware Precoding for Downlink Massive MIMO Cellular Networks

Abstract

We propose a cell-edge-aware (CEA) zero forcing (ZF) precoder that exploits the excess spatial degrees of freedom provided by a large number of base station (BS) antennas to suppress inter-cell interference at the most vulnerable user equipments (UEs). We evaluate the downlink performance of CEA-ZF, as well as that of a conventional cell-edge-unaware (CEU) ZF precoder in a network with random base station topology. Our analysis and simulations show that the proposed CEA-ZF precoder outperforms CEU-ZF precoding in terms of (i) aggregate per-cell data rate, (ii) coverage probability, and (iii) 95%-likely, or edge user, rate. In particular, when both perfect channel state information and a large number of antennas N are available at the BSs, we demonstrate that the outage probability under CEA-ZF and CEU-ZF decay as 1/N^2 and 1/N, respectively. This result identifies CEA-ZF as a more effective precoding scheme for massive MIMO cellular networks. Our framework also reveals the importance of scheduling the optimal number of UEs per BS, and confirms the necessity to control the amount of pilot contamination received during the channel estimation phase.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Howard H. Yang, Giovanni Geraci, Tony Q. S. Quek, Jeffrey G. Andrews. 2016-10-11. Cell-Edge-Aware Precoding for Downlink Massive MIMO Cellular Networks. https://doi.org/10.1109/tsp.2017.2690387

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT