Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1412.6747

An Uplink Interference Analysis for Massive MIMO Systems with MRC and ZF Receivers

Ning Liang·Wenyi zhang·Cong Shen
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper considers an uplink cellular system, in which each base station (BS) is equipped with a large number of antennas to serve multiple single-antenna user equipments (UEs) simultaneously. Uplink training with pilot reusing is adopted to acquire the channel state information (CSI) and maximum ratio combining (MRC) or zero forcing (ZF) reception is used for handling multiuser interference. Leveraging stochastic geometry to model the spatial distribution of UEs, we analyze the statistical distributions of the interferences experienced by a typical uplink: intra-cell interference, inter-cell interference and interference due to pilot contamination. For a practical but still large number of BS antennas, a key observation for MRC reception is that it is the intra-cell interference that accounts for the dominant portion of the total interference. In addition, the interference due to pilot contamination tends to have a much wider distribution range than the inter-cell interference when shadowing is strong, although their mean powers are roughly equal. For ZF reception, on the other hand, we observe a significant reduction of the intra-cell interference compared to MRC reception, while the inter-cell interference and the interference due to pilot contamination remains almost the same, thus demonstrating a substantial superiority over MRC reception.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ning Liang, Wenyi zhang, Cong Shen. 2014-12-21. An Uplink Interference Analysis for Massive MIMO Systems with MRC and ZF Receivers. https://doi.org/10.1109/wcnc.2015.7127488

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗