Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2412.07489

DFT-s-OFDM-based On-Off Keying for Low-Power Wake-Up Signal

Renaud-Alexandre Pitaval·Xiaolei Tie
View original source ↗Read source document ↗Export metadata ↓

Abstract

5G-Advanced and likely 6G will support a new low-power wake-up signal (LP-WUS) enabling low-power devices, equipped with a complementary ultra low-power receiver to monitor wireless traffic, to completely switch off their main radio. This orthogonal frequency-division multiplexed (OFDM) signal will emulate an on-off keying (OOK) modulation to enable very low-energy envelope detection at the receiver. Higher rate LP-WUS, containing multiple OOK symbols within single OFDM symbol, will be generated using the time-domain pulse multiplexing of discrete Fourier transform spread (DFT-s-) OFDM. In this context, this paper presents a comprehensive signal design framework for DFT-s-OFDM-based OOK generation. General properties of subcarrier coefficients are derived demonstrating that only DFT of the bits needs to be computed online and repeated over the band before applying appropriate frequency-domain processing. The conventional approach of generating rectangular-like OOK waveforms is then addressed by a combination of pre-DFT bit-spreading and post-DFT processing; and the least-squares (LS) method from Mazloum and Edfors, proposed for 5G LP-WUS and also Ambient-IoT, is shown to be implementable as such. Even though aesthetically pleasing and of independent interest, rectangular-like OOK waveforms are not optimal for 5G LP-WUS scenarios due to their limited robustness to channel frequency-selectivity and timing offset, and so shaping methods for spreading the OOK spectrum and concentrating the OOK symbol energy are analyzed and shown to improve the bit error rate performance under practical conditions.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Renaud-Alexandre Pitaval, Xiaolei Tie. 2025-06-17. DFT-s-OFDM-based On-Off Keying for Low-Power Wake-Up Signal. https://arxiv.org/abs/2412.07489

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↗