Approximate Message Passing for Multi-Preamble Detection in OTFS Random Access
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909770501324800 |
|---|---|
| author | Mirri, Alessandro Kunde, Vishnu Teja Paolini, Enrico Chamberland, Jean-Francois |
| author_facet | Mirri, Alessandro Kunde, Vishnu Teja Paolini, Enrico Chamberland, Jean-Francois |
| contents | This article addresses the problem of multiple preamble detection in random access systems based on orthogonal time frequency space (OTFS) signaling. This challenge is formulated as a structured sparse recovery problem in the complex domain. To tackle it, the authors propose a new approximate message passing (AMP) algorithm that enforces double sparsity: the sparse selection of preambles and the inherent sparsity of OTFS signals in the delay-Doppler domain. From an algorithmic standpoint, the non-separable complex sparsity constraint necessitates a careful derivation and leads to the design of a novel AMP denoiser. Simulation results demonstrate that the proposed method achieves robust detection performance and delivers significant gains over state-of-the-art techniques. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2509_03980 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Approximate Message Passing for Multi-Preamble Detection in OTFS Random Access Mirri, Alessandro Kunde, Vishnu Teja Paolini, Enrico Chamberland, Jean-Francois Signal Processing This article addresses the problem of multiple preamble detection in random access systems based on orthogonal time frequency space (OTFS) signaling. This challenge is formulated as a structured sparse recovery problem in the complex domain. To tackle it, the authors propose a new approximate message passing (AMP) algorithm that enforces double sparsity: the sparse selection of preambles and the inherent sparsity of OTFS signals in the delay-Doppler domain. From an algorithmic standpoint, the non-separable complex sparsity constraint necessitates a careful derivation and leads to the design of a novel AMP denoiser. Simulation results demonstrate that the proposed method achieves robust detection performance and delivers significant gains over state-of-the-art techniques. |
| title | Approximate Message Passing for Multi-Preamble Detection in OTFS Random Access |
| topic | Signal Processing |
| url | https://arxiv.org/abs/2509.03980 |