Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1811.06415

Effects of Beamforming and Antenna Configurations on Mobility in 5G NR

Edgar Ramos·Antonino Orsino
View original source ↗Read source document ↗Export metadata ↓

Abstract

The future 5G systems are getting closer to be a reality. It is envisioned, indeed, that the roll-out of first 5G network will happen around end of 2018 and beginning of 2019. However, there are still a number of issues and problems that have to be faces and new solutions and methods are needed to solve them. Along these lines, the effects that beamforming and antenna configurations may have on the mobility in 5G New Radio (NR) is still unclear. In fact, with the use of directive antennas and high frequencies (e.g., above 10 GHz), in order to meet the stringent requirements of 5G (e.g., support of 500km/h) it is crucial to understand how the envisioned 5G NR antenna configurations may impact mobility (and thus handovers). In this article, first we will briefly survey mobility enhancements and solution currently under discussion in 3GPP Release 15. In particular, we focus our analysis on the physical layer signals involved in the measurement reporting and the new radio measurement model used in 5G NR to filter the multiple beams typical of directive antenna with a large number of antenna elements. Finally, the critical aspect of mobility identified in the previous sections will be analyzed in more details through the obtained results of an extensive system-level evaluation analysis.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Edgar Ramos, Antonino Orsino. 2018-11-15. Effects of Beamforming and Antenna Configurations on Mobility in 5G NR. https://doi.org/10.13140/rg.2.2.22822.98887

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↗