SearcharxivSearch

arXiv · 2609.04669

Ultra-High Resolution Method for Multipath Within a Co-Delay-Doppler Bin in DFT-P-OCDM

Abstract

Communication systems can reuse their transmitted signals for sensing without dedicated radar transmissions. For an established DFT-preprocessed orthogonal chirp division multiplexing (DFT-P-OCDM) waveform, this task becomes difficult when several physical paths in a doubly selective channel fall into the same co-delay-Doppler bin. In this case, the number of resolvable delay classes inferred from the pilot may be smaller than the number of physical paths within the co-bin. This mismatch increases the difficulty of path number determination, fractional Doppler offset estimation, and channel reconstruction. We derive a pointwise relationship between the input and output in the DFT preprocessed Fresnel (DPF) domain for doubly selective channels with multiple paths within the co-delay-Doppler bin. Based on this input and output relation, we propose the two stage ultra high resolution (TSUR) framework. The first stage uses pilots of the phase progression to estimate delay, while the second stage uses the leakage samples to estimate the Doppler and the number of paths within each delay class. Furthermore, we derive CRLBs and analyze how the pilot configuration trades sensing resolution and communication recovery. Simulation results demonstrate that TSUR resolves same delay paths within a co-delay-Doppler bin, remains robust to exist delay offsets, and achieves lower fractional Doppler estimation errors than sequential extraction and off-grid baselines.

Explore related subjects

Keep this discovery

BibTeXRIS

Mingxuan Han, Weile Zhang, Feifei Gao. 2026-09-04. Ultra-High Resolution Method for Multipath Within a Co-Delay-Doppler Bin in DFT-P-OCDM. https://arxiv.org/abs/2609.04669

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

The maximum entropy state

We give an algorithm for calculating the maximum entropy state as the least fixed point of a Scott continuous mapping on the domain of classical states in their Bayesian order.

math.PR

Eigenvalues and eigenfunctions of the fractional Laplacian on the interval

We prove a three-term asymptotic formula for the eigenvalues of the fractional Laplacian on the bounded interval $(-1,1)$. This improves the eigenvalue asymptotics of Kulczycki--Kwaśnicki--Małecki--Stós and Kwaśnicki, and confirms the conjectural $O_α(n^{-2})$ remainder suggested by the numerical simulations of Kaleta--Kwaśnicki--Małecki. Moreover, we prove that the normalized eigenfunctions are bounded uniformly in the eigenvalue index $n$ and the fractional order $α$. This settles the conjecture proposed by Kwaśnicki through numerical experiments. Furthermore, we prove that the $n$-th eigenfunction has exactly $n-1$ zeros in the interval $(-1,1)$ and every zero is simple, and hence there are exactly $n$ nodal domains. A key ingredient in the proof is an explicit representation of the eigenfunction.

math.CA

Turing complete Navier-Stokes steady states via cosymplectic geometry

In this article, we construct stationary solutions to the Navier-Stokes equations on certain Riemannian $3$-manifolds that exhibit Turing completeness, in the sense that they are capable of performing universal computation. This universality arises on manifolds admitting nonvanishing harmonic 1-forms, thus showing that computational universality is not obstructed by viscosity, provided the underlying geometry satisfies a mild cohomological condition. The proof makes use of a correspondence between nonvanishing harmonic $1$-forms and cosymplectic geometry, which extends the classical correspondence between Beltrami fields and Reeb flows on contact manifolds.

math.DG