A complex-domain AMP algorithm with a denoiser combining elementwise and group sparsity is proposed for OTFS preamble detection, achieving simulated gains over existing methods.
Approximate message-passing decoder and capacity achieving sparse superposition codes,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
eess.SP 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Approximate Message Passing for Multi-Preamble Detection in OTFS Random Access
A complex-domain AMP algorithm with a denoiser combining elementwise and group sparsity is proposed for OTFS preamble detection, achieving simulated gains over existing methods.