Sparse Regression Codes exploit Multi-User Diversity without CSI
Fuente:
arXiv
Salvato in:
| Autori principali: | , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2025
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911058077155328 |
|---|---|
| author | Sandeep, V S V Kancharana, Sai Dinesh Kannu, Arun Pachai |
| author_facet | Sandeep, V S V Kancharana, Sai Dinesh Kannu, Arun Pachai |
| contents | We study sparse regression codes (SPARC) for multiple access channels with multiple receive antennas, in non-coherent flat fading channels. We propose a novel practical decoder, referred to as maximum likelihood matching pursuit (MLMP), which greedily finds the support of the codewords of users with partial maximum likelihood metrics. As opposed to the conventional successive-cancellation based greedy algorithms, MLMP works as a successive-combining energy detector. We also propose MLMP modifications to improve the performance at high code rates. Our studies in short block lengths show that, even without any channel state information, SPARC with MLMP decoder achieves multi-user diversity in some scenarios, giving better error performance with multiple users than that of the corresponding single-user case. We also show that SPARC with MLMP performs better than conventional sparse recovery algorithms and pilot-aided transmissions with polar codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_11383 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Sparse Regression Codes exploit Multi-User Diversity without CSI Sandeep, V S V Kancharana, Sai Dinesh Kannu, Arun Pachai Signal Processing We study sparse regression codes (SPARC) for multiple access channels with multiple receive antennas, in non-coherent flat fading channels. We propose a novel practical decoder, referred to as maximum likelihood matching pursuit (MLMP), which greedily finds the support of the codewords of users with partial maximum likelihood metrics. As opposed to the conventional successive-cancellation based greedy algorithms, MLMP works as a successive-combining energy detector. We also propose MLMP modifications to improve the performance at high code rates. Our studies in short block lengths show that, even without any channel state information, SPARC with MLMP decoder achieves multi-user diversity in some scenarios, giving better error performance with multiple users than that of the corresponding single-user case. We also show that SPARC with MLMP performs better than conventional sparse recovery algorithms and pilot-aided transmissions with polar codes. |
| title | Sparse Regression Codes exploit Multi-User Diversity without CSI |
| topic | Signal Processing |
| url | https://arxiv.org/abs/2507.11383 |