Search arXivSearch

arXiv · 1505.03682

Massive MIMO with Multi-cell MMSE Processing: Exploiting All Pilots for Interference Suppression

Abstract

In this paper, a new state-of-the-art multi-cell MMSE scheme is proposed for massive MIMO networks, which includes an uplink MMSE detector and a downlink MMSE precoder. The main novelty is that it exploits all available pilots for interference suppression. Specifically, let $K$ and $B$ denote the number of users per cell and the number of orthogonal pilot sequences in the network, respectively, where $β= B/K$ is the pilot reuse factor. Then our multi-cell MMSE scheme utilizes all $B$ channel directions, that can be estimated locally at each base station, to actively suppress both intra-cell and inter-cell interference. The proposed scheme is particularly practical and general, since power control for the pilot and payload, imperfect channel estimation and arbitrary pilot allocation are all accounted for. Simulations show that significant spectral efficiency (SE) gains are obtained over the single-cell MMSE scheme and the multi-cell ZF, particularly for large $β$ and/or $K$. Furthermore, large-scale approximations of the uplink and downlink SINRs are derived, which are asymptotically tight in the large-system limit. The approximations are easy to compute and very accurate even for small system dimensions. Using these SINR approximations, a low-complexity power control algorithm is also proposed to maximize the sum SE.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xueru Li, Emil Björnson, Erik G. Larsson, Shidong Zhou, Jing Wang. 2015-05-26. Massive MIMO with Multi-cell MMSE Processing: Exploiting All Pilots for Interference Suppression. https://arxiv.org/abs/1505.03682

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