Live
Black Hat USAAI BusinessBlack Hat AsiaAI BusinessMemahami Dasar Web Development: Mengenal Frontend dan BackendDEV CommunityCombining the robot operating system with LLMs for natural-language controlPhys.org AII tested ChatGPT vs. Claude to see which is better - and if it's worth switchingZDNet AIOpenClaw AI Agent Framework: Run Autonomous AI on Your Own HardwareDEV CommunityHow to Build an AI Wearable for Under $15 — Complete Step-by-Step GuideDEV CommunityAI Agents in Healthcare: Security Risks Every Developer Should KnowDEV Community🎲 Aleam — A True Random Number Generator built for AI.DEV CommunityLesswrong LiberatedLessWrong AII've been part of The Wiggles for 14 years, making kids' content. My son doesn't watch videos on phones.Business InsiderStack vs malloc: real-world benchmark shows 2–6x differenceDEV CommunityThe Future of the Agent Economy: What Happens When AI Can PayDEV CommunityDeploying ASP.NET Core Apps on the Flux Network Using Deploy With GitDEV CommunityBlack Hat USAAI BusinessBlack Hat AsiaAI BusinessMemahami Dasar Web Development: Mengenal Frontend dan BackendDEV CommunityCombining the robot operating system with LLMs for natural-language controlPhys.org AII tested ChatGPT vs. Claude to see which is better - and if it's worth switchingZDNet AIOpenClaw AI Agent Framework: Run Autonomous AI on Your Own HardwareDEV CommunityHow to Build an AI Wearable for Under $15 — Complete Step-by-Step GuideDEV CommunityAI Agents in Healthcare: Security Risks Every Developer Should KnowDEV Community🎲 Aleam — A True Random Number Generator built for AI.DEV CommunityLesswrong LiberatedLessWrong AII've been part of The Wiggles for 14 years, making kids' content. My son doesn't watch videos on phones.Business InsiderStack vs malloc: real-world benchmark shows 2–6x differenceDEV CommunityThe Future of the Agent Economy: What Happens When AI Can PayDEV CommunityDeploying ASP.NET Core Apps on the Flux Network Using Deploy With GitDEV Community

Low Overhead and Scalable Time-Frequency Pilots Design for MIMO OTFS Channel Estimation

arXiv eess.SPby Kailong Wang, Athina PetropuluMarch 31, 20262 min read0 views
Source Quiz

arXiv:2511.08504v2 Announce Type: replace Abstract: Orthogonal Time Frequency Space (OTFS) modulation has recently garnered attention for its robustness in high-mobility wireless communication environments. In OTFS, the data symbols are mapped to the Doppler-Delay (DD) domain. In this paper, we address low-overhead, scalable pilot-aided estimation of channel state information (CSI) for MIMO OTFS systems. Existing channel estimation techniques either require non-overlapping DD domain pilots with guard regions across multiple antennas, thus sacrificing significant communication rate as the number of transmit antennas increases, or allow pilots to overlap between antennas and rely on high-complexity methods to mitigate pilot pollution. We propose a novel pilot placement approach that embeds p

View PDF HTML (experimental)

Abstract:Orthogonal Time Frequency Space (OTFS) modulation has recently garnered attention for its robustness in high-mobility wireless communication environments. In OTFS, the data symbols are mapped to the Doppler-Delay (DD) domain. In this paper, we address low-overhead, scalable pilot-aided estimation of channel state information (CSI) for MIMO OTFS systems. Existing channel estimation techniques either require non-overlapping DD domain pilots with guard regions across multiple antennas, thus sacrificing significant communication rate as the number of transmit antennas increases, or allow pilots to overlap between antennas and rely on high-complexity methods to mitigate pilot pollution. We propose a novel pilot placement approach that embeds pilots within the time-frequency (TF) frame of each OTFS burst, along with a new use of TF and DD guard bins to preserve waveform orthogonality on the TF pilot bins and data integrity in the DD domain, respectively. The proposed pilot placement enables low-complexity coarse estimation of the channel parameters. Moreover, the pilot orthogonality allows the construction of a virtual array (VA), enabling the formulation of a sparse signal recovery (SSR) problem in which the coarse estimates are used to build a low-dimensional dictionary matrix. The SSR solution then yields high-resolution estimates of the channel parameters. Simulation results show that the proposed approach achieves good performance with very low overhead and is robust to pilot pollution. Importantly, the required overhead is independent of the number of transmit antennas, ensuring scalability to large MIMO arrays. The proposed approach accounts for practical rectangular transmit pulse shaping and receiver matched filtering, as well as fractional Doppler effects.

Subjects:

Signal Processing (eess.SP)

Cite as: arXiv:2511.08504 [eess.SP]

(or arXiv:2511.08504v2 [eess.SP] for this version)

https://doi.org/10.48550/arXiv.2511.08504

arXiv-issued DOI via DataCite

Submission history

From: Kailong Wang [view email] [v1] Tue, 11 Nov 2025 17:39:22 UTC (478 KB) [v2] Sun, 29 Mar 2026 23:29:34 UTC (199 KB)

Was this article helpful?

Sign in to highlight and annotate this article

AI
Ask AI about this article
Powered by AI News Hub · full article context loaded
Ready

Conversation starters

Ask anything about this article…

Daily AI Digest

Get the top 5 AI stories delivered to your inbox every morning.

More about

announcepaperarxiv

Knowledge Map

Knowledge Map
TopicsEntitiesSource
Low Overhea…announcepaperarxivarXiv eess.…

Connected Articles — Knowledge Graph

This article is connected to other articles through shared AI topics and tags.

Knowledge Graph100 articles · 223 connections
Scroll to zoom · drag to pan · click to open

Discussion

Sign in to join the discussion

No comments yet — be the first to share your thoughts!

More in Releases