Search arXivSearch

arXiv · 1608.00661

Time-Domain N-continuous GFDM

Abstract

Generalized frequency division multiplexing (GFDM) has been a candidate multicarrier scheme in the 5th generation cellular networks for its flexibility of transmitter filter in time and frequency. However, for the circularly shaped transmitter filter, GFDM provides limited performance gain of sidelobe suppression. In this paper, we propose a scheme, called time-domain N-continuous GFDM (TD-NC-GFDM), to reduce the discontinuities caused by the GFDM transmitter filter and achieve promising sidelobe suppression gain. Based on time-domain N-continuous orthogonal frequency devision multiplexing (TD-NC-OFDM), TD-NC-GFDM signal can be obtained by superposing a smooth signal in the time domain. The smooth signal is linearly combined by basis signals in a new basis set related to GFDM transmitter waveform. To eliminate the interference caused by the smooth signal, two solutions are proposed. Firstly, a signal recovery algorithm for reception is adopted at the cost of high complexity. Thus, secondly, to simplify the TD-NC-GFDM receiver, a low-interference TD-NC-GFDM is proposed by redesigning the basis signals. A soft truncation of the basis signals in TD-NC-GFDM is given to design the basis signals in the low-interference TD-NC-GFDM. Then, the smooth signal is aligned with the beginning of the GFDM symbol and is added in the front part of the GFDM symbol. Moreover, for a big number of GFDM subsymbols, theoretical analysis proves that the signal-to-interference ratio (SIR) in TD-NC-GFDM is much higher than that in TD-NC-OFDM. Simulation results shows that TD-NC-GFDM can obtain significant sidelobe suppression performance as well as the low-interference TD-NC-GFDM, which can achieve the same BER performance as the original GFDM.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Peng Wei. 2016-08-02. Time-Domain N-continuous GFDM. https://doi.org/10.1109/tcomm.2019.2952601

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