Search arXivSearch

arXiv · 1903.02333

Generalized Fast-Convolution-based Filtered-OFDM: Techniques and Application to 5G New Radio

Abstract

This paper proposes a generalized model and methods for fast-convolution (FC)-based waveform generation and processing with specific applications to fifth generation new radio (5G-NR). Following the progress of 5G-NR standardization in 3rd generation partnership project (3GPP), the main focus is on subband-filtered cyclic prefix (CP) orthogonal frequency-division multiplexing (OFDM) processing with specific emphasis on spectrally well localized transmitter processing. Subband filtering is able to suppress the interference leakage between adjacent subbands, thus supporting different numerologies for so-called bandwidth parts as well as asynchronous multiple access. The proposed generalized FC scheme effectively combines overlapped block processing with time- and frequency-domain windowing to provide highly selective subband filtering with very low intrinsic interference level. Jointly optimized multi-window designs with different allocation sizes and design parameters are compared in terms of interference levels and implementation complexity. The proposed methods are shown to clearly outperform the existing state-of-the-art windowing and filtering-based methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Juha Yli-Kaakinen, Toni Levanen, Arto Palin, Markku Renfors, Mikko Valkama. 2020-02-15. Generalized Fast-Convolution-based Filtered-OFDM: Techniques and Application to 5G New Radio. https://doi.org/10.1109/tsp.2020.2971949

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