Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1803.02729

Frequency and Quadrature Amplitude Modulation for 5G Networks

Shangbin Wu·Yue Wang·Mohammed Al-Imari·Maziar Nekovee
View original source ↗Read source document ↗Export metadata ↓

Abstract

The emerging fifth generation (5G) wireless access network, aiming at providing ubiquitous and high data rate connectivity, is envisaged to deploy large number of base stations with higher density and smaller sizes, where inter-cell interference (ICI) becomes a critical problem. Frequency quadrature amplitude modulation (FQAM) has been shown to reduce the ICI at the cell edge therefore achieve a higher transmission rate for cell edge users. This paper investigates the detection of FQAM symbols and noise plus ICI in a multi-cell FQAM communication network. Turbo-coded bit error rate (BER) and frame error rate (FER) of multi-cell FQAM are studied. Also, the cumulative distribution function (CDF) of signal to noise plus interference (SINR) of multi-cell FQAM is computed using stochastic geometry. It is demonstrated via simulations FQAM outperforms quadrature amplitude modulation (QAM) in BER and FER when ICI is significant. Furthermore, FQAM can achieve better SINR than QAM.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shangbin Wu, Yue Wang, Mohammed Al-Imari, Maziar Nekovee. 2018-03-07. Frequency and Quadrature Amplitude Modulation for 5G Networks. https://doi.org/10.1109/eucnc.2016.7560993

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↗