Energy efficient coded random access for the wireless uplink
© 1972-2012 IEEE. We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free, and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for the AWGN MAC, in the practically more relev...
| Main Authors: | , , , |
|---|---|
| 格式: | 文件 |
| 语言: | English |
| 出版: |
Institute of Electrical and Electronics Engineers (IEEE)
2021
|
| 在线阅读: | https://hdl.handle.net/1721.1/135405 |
| _version_ | 1826213149032841216 |
|---|---|
| author | Kowshik, Suhas S Andreev, Kirill Frolov, Alexey Polyanskiy, Yury |
| author_facet | Kowshik, Suhas S Andreev, Kirill Frolov, Alexey Polyanskiy, Yury |
| author_sort | Kowshik, Suhas S |
| collection | MIT |
| description | © 1972-2012 IEEE. We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free, and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for the AWGN MAC, in the practically more relevant case of Rayleigh fading, when channel gains are unknown to the decoder. We propose a random coding achievability bound, which we analyze both non-asymptotically and asymptotically. As a candidate practical solution, we propose an explicit iterative coding scheme. The performance of such a solution is surprisingly close to the finite blocklength bounds. Our main findings are twofold. First, just like in the AWGN MAC, we see that jointly decoding a large number of users leads to a surprising phase transition effect, where, at spectral efficiencies below a critical threshold, a perfect multi-user interference cancellation is possible. Second, while the presence of Rayleigh fading significantly increases the minimal required energy-per-bit, the inherent randomization introduced by the channel makes it much easier to attain the optimal performance via iterative schemes. We hope that a principled definition of the random-access model, together with their information-theoretic analysis, will open the road towards unified benchmarking and performance comparison of various random-access solutions for the 5G/6G. |
| first_indexed | 2024-09-23T15:44:06Z |
| format | Article |
| id | mit-1721.1/135405 |
| institution | Massachusetts Institute of Technology |
| language | English |
| last_indexed | 2024-09-23T15:44:06Z |
| publishDate | 2021 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/1354052021-10-28T03:19:58Z Energy efficient coded random access for the wireless uplink Kowshik, Suhas S Andreev, Kirill Frolov, Alexey Polyanskiy, Yury © 1972-2012 IEEE. We discuss the problem of designing channel access architectures for enabling fast, low-latency, grant-free, and uncoordinated uplink for densely packed wireless nodes. Specifically, we study random-access codes, previously introduced for the AWGN MAC, in the practically more relevant case of Rayleigh fading, when channel gains are unknown to the decoder. We propose a random coding achievability bound, which we analyze both non-asymptotically and asymptotically. As a candidate practical solution, we propose an explicit iterative coding scheme. The performance of such a solution is surprisingly close to the finite blocklength bounds. Our main findings are twofold. First, just like in the AWGN MAC, we see that jointly decoding a large number of users leads to a surprising phase transition effect, where, at spectral efficiencies below a critical threshold, a perfect multi-user interference cancellation is possible. Second, while the presence of Rayleigh fading significantly increases the minimal required energy-per-bit, the inherent randomization introduced by the channel makes it much easier to attain the optimal performance via iterative schemes. We hope that a principled definition of the random-access model, together with their information-theoretic analysis, will open the road towards unified benchmarking and performance comparison of various random-access solutions for the 5G/6G. 2021-10-27T20:23:20Z 2021-10-27T20:23:20Z 2020 2021-03-09T20:13:57Z Article http://purl.org/eprint/type/JournalArticle https://hdl.handle.net/1721.1/135405 en 10.1109/TCOMM.2020.3000635 IEEE Transactions on Communications Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) arXiv |
| spellingShingle | Kowshik, Suhas S Andreev, Kirill Frolov, Alexey Polyanskiy, Yury Energy efficient coded random access for the wireless uplink |
| title | Energy efficient coded random access for the wireless uplink |
| title_full | Energy efficient coded random access for the wireless uplink |
| title_fullStr | Energy efficient coded random access for the wireless uplink |
| title_full_unstemmed | Energy efficient coded random access for the wireless uplink |
| title_short | Energy efficient coded random access for the wireless uplink |
| title_sort | energy efficient coded random access for the wireless uplink |
| url | https://hdl.handle.net/1721.1/135405 |
| work_keys_str_mv | AT kowshiksuhass energyefficientcodedrandomaccessforthewirelessuplink AT andreevkirill energyefficientcodedrandomaccessforthewirelessuplink AT frolovalexey energyefficientcodedrandomaccessforthewirelessuplink AT polyanskiyyury energyefficientcodedrandomaccessforthewirelessuplink |