Search arXivSearch

arXiv · 2603.08442

OFDM Waveform Optimization for Bistatic Integrated Sensing and Communications

Abstract

This paper investigates the design of orthogonal frequency-division multiplexing (OFDM) waveforms for bistatic integrated sensing and communication (ISAC) systems. In the considered framework, an ISAC transmitter jointly optimizes subcarrier assignment and power allocation for a single OFDM waveform that simultaneously supports communication and sensing functionalities. Meanwhile, an ISAC receiver decodes information on communication subcarriers and estimates per-path propagation delays via exploiting pilot symbols on sensing subcarriers. We propose a joint path coefficient and delay estimation (JPCDE) scheme, revealing that the achievable communication data rate (CDR) is determined by the number of communication subcarriers, whereas the delay sensing accuracy is governed by the index distribution of sensing subcarriers. Building on this insight, we formulate an OFDM waveform optimization problem to maximize the CDR subject to sensing-accuracy and power-budget constraints. To solve this problem, we employ a quadratic transform and Lagrangian dual decomposition, which iteratively updates the subcarrier assignment and power allocation variables in closed-form. Our results reveal that a subcarrier is allocated for sensing if and only if its Fisher information gain exceeds the corresponding communication rate loss, while the power allocation for communication subcarriers exhibits a bounded water-filling structure. Simulation results demonstrate that the proposed frameworks substantially outperform existing baselines in both delay estimation accuracy and CDR.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ruolin Du, Zhiqiang Wei, Zai Yang, Ya-Feng Liu, Bingpeng Zhou, Derrick Wing Kwan Ng. 2026-03-09. OFDM Waveform Optimization for Bistatic Integrated Sensing and Communications. https://arxiv.org/abs/2603.08442

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