Search arXivSearch

arXiv · 2510.09215

A Hybrid I/O Relation Estimation Scheme for Zak-OTFS Receivers

Abstract

In this paper, we consider the problem of estimating the delay-Doppler (DD) domain input-output (I/O) relation in Zak-OTFS modulation, which is needed for signal detection. Two approaches, namely, model-dependent and model-free approaches, can be employed for this purpose. The model-dependent approach requires explicit estimation of the physical channel parameters (path delays, Dopplers, and gains) to obtain the I/O relation. Such an explicit estimation is not required in the model-free approach, where the I/O relation can be estimated by reading off the samples in the fundamental DD period of the received pilot frame. Model-free approach has the advantage of acquiring fractional DD channels with simplicity. However, the read-off in the model-free approach provides an estimate of the effective channel only over a limited region in the DD plane but it does not provide an estimate for the region outside, and this can affect the estimation performance depending on the pulse shaping characteristics of the DD pulse shaping filter used. A poorly localized DD pulse shape leads to an increased degradation in performance. Motivated by this, in this paper, we propose a novel, yet simple, I/O relation estimation scheme that alleviates the above issue in the model-free approach. We achieve this by obtaining a coarse estimate of the effective channel outside the model-free estimation region using a novel model-dependent scheme and using this estimate along with the model-free estimate to obtain an improved estimate of the overall I/O relation. We devise the proposed estimation scheme for both exclusive and embedded pilot frames. Our simulation results using Vehicular-A, TDL-A and TDL-C channel models with fractional DDs show that the proposed hybrid estimation approach achieves superior performance compared to the pure model-free approach.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sai Pradeep Muppaneni, Vineetha Yogesh, A. Chockalingam. 2025-10-10. A Hybrid I/O Relation Estimation Scheme for Zak-OTFS Receivers. https://arxiv.org/abs/2510.09215

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