Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2607.08247

Multiuser Zak-OTFS on the Uplink with Superimposed Spread-Pilots

Sai Pradeep Muppaneni·Ananthanarayanan Chockalingam
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we consider the uplink of a multiuser Zak-OTFS system comprising users with heterogeneous delay-Doppler (DD) periods/frame sizes. Multiple access is achieved through time-frequency (TF) shifts that place the users in non-overlapping regions of the TF plane. Closed-form expressions for the effective DD domain channel between each user and the base station are derived for sinc and Gaussian pulse shaping filters. The inter-user interference (IUI) is shown to be negligible under the TF-shift-based multiple access, thereby decoupling the multiuser input-output relation (IOR) estimation problem into independent single-user estimation problems. For IOR estimation, a superimposed spread-pilot framework is employed. The spread-pilot sequence is obtained by applying FFT to a reshaped Zadoff-Chu sequence. To mitigate the pilot-data interference introduced by the superimposed spread-pilot, a DD dictionary-based IOR estimation scheme that iterates between IOR estimation and data detection is employed. Simulation results for a multiuser Zak-OTFS system demonstrate that the resulting IOR estimates achieve normalized mean-square error (NMSE) and bit error rate (BER) performances that closely match those of the corresponding single-user system. Furthermore, for sinc pulse shaping, the superimposed spread-pilot frame achieves higher spectral-efficiency compared to embedded pilot frame across a wide range of inter-user power ratios. For Gaussian pulse shaping, however, the embedded pilot frame achieves a higher spectral efficiency due to the combined effects of residual IUI and significant pilot-data interference in the case of superimposed spread-pilot. The robustness of the estimation framework to variations in channel power-delay profile and maximum Doppler shift is also demonstrated.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sai Pradeep Muppaneni, Ananthanarayanan Chockalingam. 2026-07-09. Multiuser Zak-OTFS on the Uplink with Superimposed Spread-Pilots. https://arxiv.org/abs/2607.08247

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↗