Derivation of OTFS Modulation from First Principles

Saif Khan Mohammed

Home/Archive/arXiv

arXiv · 2007.14357

Derivation of OTFS Modulation from First Principles

Saif Khan Mohammed

View original source ↗Read source document ↗Export metadata ↓

Abstract

Orthogonal Time Frequency Space (OTFS) modulation has been recently proposed to be robust to channel induced Doppler shift in high mobility wireless communication systems. However, to the best of our knowledge, none of the prior works on OTFS have derived it from first principles. In this paper, using the ZAK representation of time-domain (TD) signals, we rigorously derive an orthonormal basis of approximately time and bandwidth limited signals which are also localized in the delay-Doppler (DD) domain. We then consider DD domain modulation based on this orthonormal basis, and derive OTFS modulation. To the best of our knowledge, this is the first paper to rigorously derive OTFS modulation from first principles. We show that irrespective of the amount of Doppler shift, the received DD domain basis signals are localized in a small interval of size roughly equal to the inverse time duration along the Doppler domain and of size roughly equal to the inverse bandwidth along the delay domain (time duration refers to the length of the time-interval where the TD transmit signal has been limited). With sufficiently large time duration and bandwidth, there is little interference between information symbols modulated on different basis signals, which allows for joint DD domain equalization of all information symbols. This explains the inherent robustness of DD domain modulation to channel induced Doppler shift when compared with Orthogonal Frequency Division Multiplexing (OFDM). The degree of localization of the DD domain basis signals is inversely related to the time duration of the transmit signal, which explains the trade-off between robustness to Doppler shift and latency.

Explore related subjects

cs.IT math.IT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Saif Khan Mohammed. 2020-07-28. Derivation of OTFS Modulation from First Principles. https://arxiv.org/abs/2007.14357

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

KEEP EXPLORING

Related papers

arXiv2026

Bistatic Target Detection by Exploiting Both Deterministic Pilots and Unknown Random Data Payloads

Integrated sensing and communication (ISAC) plays a crucial role in 6G, to enable innovative applications such as drone surveillance, urban air mobility, and low-altitude logistics. However, the hybrid ISAC signal, which comprises deterministic pilot and random data payload components, poses challenges for target detection due to two reasons: 1) these two components cause coupled shifts in both the mean and variance of the received signal, and 2) the random data payloads are typically unknown to the sensing receiver in the bistatic setting. Unfortunately, these challenges could not be tackled by existing target detection algorithms. In this paper, a generalized likelihood ratio test (GLRT)-based detector is derived, by leveraging the known deterministic pilots and the statistical characteristics of the unknown random data payloads. Due to the analytical intractability of exact performance characterization, we perform an asymptotic analysis for the false alarm probability and detection probability of the proposed detector. The results highlight a critical trade-off: both deterministic and random components improve detection reliability, but the latter also brings statistical uncertainty that hinders detection performance. Simulations validate the theoretical findings and demonstrate the effectiveness of the proposed detector, which highlights the necessity of designing a dedicated detector to fully exploited the signaling resources assigned to random data payloads.

cs.IT↗

arXiv2026

On Unbiased Parameter Estimation and Signal Reconstruction

In this paper, we extend the theory of depth-unbiased source localization to unbiased parameter estimation and signal reconstruction for an arbitrary number of non-zero parameters. The topic touches on exact reconstructibility, most commonly studied in compressed sensing and multisource estimation across various imaging problems. The theoretical results derive upper bounds on the number of recoverable parameters in the noiseless case, and define a probability measure to assess the likelihood of recovering all non-zero parameters with correct magnitude order. The work provides a mathematical explanation of the open question regarding the noise robustness of standardized and unbiased methods. The paper also reveals a trade-off between the number of sensors and the signal-to-noise ratio. Numerical experiments demonstrate the theoretical findings.

cs.IT↗

arXiv2026

Minimum enclosing Bregman balls made easy

In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1+ε)$-approximation algorithm for computing power MEBs, for any $ε>0$. This power MEB approximation algorithm coincides with the Bregman MEB approximation algorithm of Nock and Nielsen (2005) when expressed in the dual gradient space. Finally, we show that the Bregman potential lifting transforms used to construct Bregman Voronoi diagrams can be reinterpreted as the classical paraboloid lifting transform applied to corresponding weighted point sets. In particular, Bregman MEB circumcenters lie on the farthest Bregman Voronoi diagrams or equivalently on the corresponding farthest power diagrams.

cs.IT↗