Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1606.04476

Downlink Performance of Superimposed Pilots in Massive MIMO systems

Karthik Upadhya·Sergiy A. Vorobyov·Mikko Vehkapera
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we investigate the downlink throughput performance of a massive multiple-input multiple-output (MIMO) system that employs superimposed pilots for channel estimation. The component of downlink (DL) interference that results from transmitting data alongside pilots in the uplink (UL) is shown to decrease at a rate proportional to the square root of the number of antennas at the BS. The normalized mean-squared error (NMSE) of the channel estimate is compared with the Bayesian Cramér-Rao lower bound that is derived for the system, and the former is also shown to diminish with increasing number of antennas at the base station (BS). Furthermore, we show that staggered pilots are a particular case of superimposed pilots and offer the downlink throughput of superimposed pilots while retaining the UL spectral and energy efficiency of regular pilots. We also extend the framework for designing a hybrid system, consisting of users that transmit either regular or superimposed pilots, to minimize both the UL and DL interference. The improved NMSE and DL rates of the channel estimator based on superimposed pilots are demonstrated by means of simulations.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Karthik Upadhya, Sergiy A. Vorobyov, Mikko Vehkapera. 2018-03-20. Downlink Performance of Superimposed Pilots in Massive MIMO systems. https://arxiv.org/abs/1606.04476

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↗