Search arXivSearch

arXiv · 1611.01130

Pilot Distribution Optimization and Power Control in Multi-Cellular Large Scale MIMO Systems

Abstract

Massive MIMO communication systems have been identified as one of the most prominent technologies of the next generation wireless standards, such as 5G, due to the large gains in energy and spectral efficiency that can be achieved. In the asymptotic condition of infinite number of antennas at the base station (BS), the performance bottleneck of these systems is due to the pilot contamination effect, i.e., the directional interference arising from users in adjacent cells that reuse the same set of orthogonal training sequences, and thus the interference seen by each user is determined by the pilot sequence assigned to him. We show in this paper that the system performance can be improved by appropriately assigning the pilot sequences to the users, in the so-called pilot allocation scheme. Depending on the optimization metric adopted, it is more advantageous to a user with certain long- term fading coefficient be assigned to a specific pilot sequence, whose interference can be completely estimated in advance by the BS by only knowing the long term fading coefficients of users in adjacent cells. Besides, if the objective is to maximize the number of users with a target quality of service, we have shown that the pilot allocation schemes can be combined with power control algorithms, resulting in much more improvements for the system. For unitary frequency reuse factor, we have found that the data throughput provided for 95% of the users increases when applying power control algorithm from 134kbps to 1.461Mbps with no pilot allocation, while this performance gain provided by power control changes from 793kbps to 6.743Mbps when pilot allocation is employed. If the reuse factor increases to 3, a 95%-likely data throughput of 17.310Mbps can be assured when pilot allocation and power control are suitably combined.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jose Carlos Marinello, Taufik Abrao. 2016-11-03. Pilot Distribution Optimization and Power Control in Multi-Cellular Large Scale MIMO Systems. https://arxiv.org/abs/1611.01130

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