Search arXivSearch

arXiv · 1410.7675

Achievable Rates and Training Optimization for Uplink Multiuser Massive MIMO Systems

Abstract

We study the performance of uplink transmission in a large-scale (massive) MIMO system, where all the transmitters have single antennas and the base station has a large number of antennas. Specifically, we first derive the rates that are possible through minimum mean-squared error (MMSE) channel estimation and three linear receivers: maximum ratio combining (MRC), zero-forcing (ZF), and MMSE. Based on the derived rates, we quantify the amount of energy savings that are possible through increased number of base-station antennas or increased coherence interval. We also analyze achievable total degrees of freedom (DoF) of such a system without assuming channel state information at the receiver, which is shown to be the same as that of a point-to-point MIMO channel. Linear receiver is sufficient to achieve total DoF when the number of users is less than the number of antennas. When the number of users is equal to or larger than the number of antennas, nonlinear processing is necessary to achieve the full degrees of freedom. Finally, the training period and optimal training energy allocation under the average and peak power constraints are optimized jointly to maximize the achievable sum rate when either MRC or ZF receiver is adopted at the receiver.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Songtao Lu, Zhengdao Wang. 2016-06-12. Achievable Rates and Training Optimization for Uplink Multiuser Massive MIMO Systems. https://arxiv.org/abs/1410.7675

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