Search arXivSearch

arXiv · 1710.00722

DFT-Spread OFDM with Frequency Domain Reference Symbols

Abstract

The fifth generation (5G) wireless standard will support several new use cases and 10 to 100 times the performance of fourth generation (4G) systems. Because of the diverse applications for 5G, flexible solutions which can address conflicting requirements will be needed. In this paper, we propose a solution which enables the use of discrete Fourier transform spread orthogonal frequency division multiplexing (DFT-s-OFDM) and OFDM, which address different requirements, using a common reference symbol (RS) design. In this solution, the DFT-s-OFDM symbol contains RSs in the frequency domain that may be shared by a subsequent OFDM symbol. The proposed scheme is generated by puncturing the output of a DFT-spread block and replacing the punctured samples with RSs in frequency. We prove that puncturing the interleaved samples at the output of the DFT-spread operation equivalently introduces a periodic interference to the data symbols at the input of the DFT-spread operation. We show that the interference due to the puncturing can be removed with a low-complexity receiver by exploiting the zeros inserted to certain locations before the DFT-spread block at the transmitter. Simulation results support that the proposed scheme removes the error floor caused by the puncturing and achieves lower peak-to-average-power ratio than OFDM.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Alphan Şahin, Erdem Bala, Rui Yang, Robert L. Olesen. 2017-10-02. DFT-Spread OFDM with Frequency Domain Reference Symbols. https://arxiv.org/abs/1710.00722

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