Pilot-Free Unsourced Random Access Via Dictionary Learning and Error-Correcting Codes
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915222338404352 |
|---|---|
| author | Zhang, Zhentian Dang, Jian Zhang, Zaichen Wu, Liang Zhu, Bingcheng Wang, Lei |
| author_facet | Zhang, Zhentian Dang, Jian Zhang, Zaichen Wu, Liang Zhu, Bingcheng Wang, Lei |
| contents | Massive machine-type communications (mMTC) or massive access is a critical scenario in the fifth generation (5G) and the future cellular network. With the surging density of devices from millions to billions, unique pilot allocation becomes inapplicable in the user ID-incorporated grant-free random access protocol. Unsourced random access (URA) manifests itself by focusing only on unwrapping the received signals via a common codebook. In this paper, we propose a URA protocol for a massive access cellular system equipped with multiple antennas at the base station. The proposed scheme encompasses a codebook enabling construction of sparse transmission frame, a receiver equipped with dictionary learning and error-correcting codes and a collision resolution strategy for the collided codeword. Discrepant to the existing schemes with necessary overhead for preamble signals, no overhead or pre-defined pilot sequences are needed in the proposed scheme, which is favorable for energy-efficient transmission and latency reduction. Numerical results verify the viability of the proposed scheme in practical massive access scenario. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2303_05070 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Pilot-Free Unsourced Random Access Via Dictionary Learning and Error-Correcting Codes Zhang, Zhentian Dang, Jian Zhang, Zaichen Wu, Liang Zhu, Bingcheng Wang, Lei Information Theory Massive machine-type communications (mMTC) or massive access is a critical scenario in the fifth generation (5G) and the future cellular network. With the surging density of devices from millions to billions, unique pilot allocation becomes inapplicable in the user ID-incorporated grant-free random access protocol. Unsourced random access (URA) manifests itself by focusing only on unwrapping the received signals via a common codebook. In this paper, we propose a URA protocol for a massive access cellular system equipped with multiple antennas at the base station. The proposed scheme encompasses a codebook enabling construction of sparse transmission frame, a receiver equipped with dictionary learning and error-correcting codes and a collision resolution strategy for the collided codeword. Discrepant to the existing schemes with necessary overhead for preamble signals, no overhead or pre-defined pilot sequences are needed in the proposed scheme, which is favorable for energy-efficient transmission and latency reduction. Numerical results verify the viability of the proposed scheme in practical massive access scenario. |
| title | Pilot-Free Unsourced Random Access Via Dictionary Learning and Error-Correcting Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2303.05070 |