Zak-OTFS-based coded random access for uplink mMTC

This paper proposes a grant-free coded random access (CRA) scheme for uplink massive machine-type communications (mMTC), based on Zak-orthogonal time–frequency space (Zak-OTFS) modulation in the delay–Doppler domain. The scheme is tailored for doubly selective wireless channels, where conventional orthogonal frequency-division multiplexing (OFDM)-based CRA suffers from unreliable inter-slot channel prediction due to time–frequency variability. By exploiting the predictable nature of Zak-OTFS, the proposed approach enables accurate channel estimation across slots, facilitating reliable successive interference cancellation across user packet replicas. A fair comparison with an OFDM-based CRA baseline shows that the proposed scheme achieves significantly lower packet loss rates under high mobility and user density. Extensive simulations over the standardized Veh-A channel confirm the robustness and scalability of Zak-OTFS-based CRA, supporting its applicability to future mMTC deployments.

Authors

Institutions

Publication Details

Journal
Journal on Advances in Signal Processing
Published
2026-01-07
DOI
https://doi.org/10.1186/s13634-025-01286-9
Primary Topic
IoT Networks and Protocols
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Zak-OTFS-based coded random access for uplink mMTC

Beyza Dabak, Enrico Paolini, Venkatesh Khammammetti, Alessandro Mirri et al.
Journal on Advances in Signal Processing
IoT Networks and Protocols
article

Zak-OTFS-based coded random access for uplink mMTC

Beyza Dabak, Enrico Paolini, Venkatesh Khammammetti, Alessandro Mirri, Robert Calderbank, Krishna Narayanan
article en

Abstract

This paper proposes a grant-free coded random access (CRA) scheme for uplink massive machine-type communications (mMTC), based on Zak-orthogonal time–frequency space (Zak-OTFS) modulation in the delay–Doppler domain. The scheme is tailored for doubly selective wireless channels, where conventional orthogonal frequency-division multiplexing (OFDM)-based CRA suffers from unreliable inter-slot channel prediction due to time–frequency variability. By exploiting the predictable nature of Zak-OTFS, the proposed approach enables accurate channel estimation across slots, facilitating reliable successive interference cancellation across user packet replicas. A fair comparison with an OFDM-based CRA baseline shows that the proposed scheme achieves significantly lower packet loss rates under high mobility and user density. Extensive simulations over the standardized Veh-A channel confirm the robustness and scalability of Zak-OTFS-based CRA, supporting its applicability to future mMTC deployments.

Journal on Advances in Signal ProcessingVol. 2026(1)
Duke University (US), Texas A&M University (US), University of Bologna (IT)
Openalex Percentile: Top 94%
IoT Networks and Protocols
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Zak-OTFS-based coded random access for uplink mMTC — Beyza Dabak, Enrico Paolini, et al. · Journal on Advances in Signal Processing (2026) | TGRS Research Map | TGRS