File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICCT50939.2020.9295815
- Scopus: eid_2-s2.0-85099542663
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Design of Deterministic Grant-Free Access with Deep Reinforcement Learning
| Title | Design of Deterministic Grant-Free Access with Deep Reinforcement Learning |
|---|---|
| Authors | |
| Keywords | 5G deep reinforcement learning grant-free access interference canceling codes |
| Issue Date | 2020 |
| Citation | International Conference on Communication Technology Proceedings ICCT, 2020, v. 2020-October, p. 944-948 How to Cite? |
| Abstract | Relying on the special mathematical properties among the access patterns of users, deterministic grant-free access can achieve ultra-high reliability within a finite time duration, and thus is favorable in coping with the challenge in ultra-reliable low-latency communications (URLLC) for 5G. Recently, interference canceling (IC) codes, proposed for access under the successive interference cancellation technique at the physical layer, have been becoming a hot research topic. However, it is difficult to obtain IC codes by the current mathematical tools or traditional search algorithms. To fill this gap, we put forth a deep reinforcement learning (DRL) based algorithm to search IC codes, with carefully designed metrics and reward functions as per the underlying mathematical constraints. The search results indicate that the algorithm can efficiently discover IC codes, while the simulation results indicate that the discovered IC codes yield significantly lower failure probability than the random access protocol given the same latency requirements, and thus are more suitable for URLLC. |
| Persistent Identifier | http://hdl.handle.net/10722/363390 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Yu, Hanqing | - |
| dc.contributor.author | Kang, Yajie | - |
| dc.contributor.author | Shi, Ze | - |
| dc.contributor.author | Shao, Yulin | - |
| dc.contributor.author | Lin, Yan | - |
| dc.contributor.author | Zhang, Yijin | - |
| dc.date.accessioned | 2025-10-10T07:46:28Z | - |
| dc.date.available | 2025-10-10T07:46:28Z | - |
| dc.date.issued | 2020 | - |
| dc.identifier.citation | International Conference on Communication Technology Proceedings ICCT, 2020, v. 2020-October, p. 944-948 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/363390 | - |
| dc.description.abstract | Relying on the special mathematical properties among the access patterns of users, deterministic grant-free access can achieve ultra-high reliability within a finite time duration, and thus is favorable in coping with the challenge in ultra-reliable low-latency communications (URLLC) for 5G. Recently, interference canceling (IC) codes, proposed for access under the successive interference cancellation technique at the physical layer, have been becoming a hot research topic. However, it is difficult to obtain IC codes by the current mathematical tools or traditional search algorithms. To fill this gap, we put forth a deep reinforcement learning (DRL) based algorithm to search IC codes, with carefully designed metrics and reward functions as per the underlying mathematical constraints. The search results indicate that the algorithm can efficiently discover IC codes, while the simulation results indicate that the discovered IC codes yield significantly lower failure probability than the random access protocol given the same latency requirements, and thus are more suitable for URLLC. | - |
| dc.language | eng | - |
| dc.relation.ispartof | International Conference on Communication Technology Proceedings ICCT | - |
| dc.subject | 5G | - |
| dc.subject | deep reinforcement learning | - |
| dc.subject | grant-free access | - |
| dc.subject | interference canceling codes | - |
| dc.title | Design of Deterministic Grant-Free Access with Deep Reinforcement Learning | - |
| dc.type | Conference_Paper | - |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.doi | 10.1109/ICCT50939.2020.9295815 | - |
| dc.identifier.scopus | eid_2-s2.0-85099542663 | - |
| dc.identifier.volume | 2020-October | - |
| dc.identifier.spage | 944 | - |
| dc.identifier.epage | 948 | - |
