Real-Time Low-Complexity Zak-OTFS with Superimposed Spread Pilots on GPUs
Orthogonal time frequency space (OTFS) modulation offers robust performance under high-mobility scenarios. Spread pilots distribute pilot energy across the delay-Doppler grid and are superimposed with data symbols, enabling full-grid resource utilization. However, pilot-data separation challenges the design of the real-time receiver pipeline: cross-ambiguity in channel sensing incurs high computational complexity, and pilot-data interference cancellation requires repeated processing through turbo iterations. Leveraging the chirp structure of OTFS spread pilots, we reduce cross-ambiguity to a single 2D IFFT with element-wise chirp operations, achieving over 7000x speedup compared to partially vectorized direct evaluation on GPUs at a frame size of (M, N)=(2053, 31). Our real-time GPU baseband processing pipeline for OTFS with superimposed spread pilots supports (M, N)=(2053, 31) with one turbo iteration within a 1.03 ms latency budget. We further show that larger frames increase processing gain, allowing lower pilot power and near-converged bit error rate (BER) after one turbo iteration.
Authors
- Vineetha Yogesh (ORCID: https://orcid.org/0009-0005-5517-8820)
- Robert Calderbank (ORCID: https://orcid.org/0000-0003-2084-9717)
- Mudasir Ahmad Sheikh (ORCID: https://orcid.org/0000-0002-0163-3315)
- Danish Nisar (ORCID: https://orcid.org/0009-0009-6520-3646)
- Junyao Zheng (ORCID: https://orcid.org/0009-0002-3729-3540)
- Chung-Hsuan Tung
- Tingjun Chen
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-12
- DOI
- https://doi.org/10.48550/arxiv.2611.16177
- Primary Topic
- PAPR reduction in OFDM
- Type
- preprint