PDCCH Scheduling via Maximum Independent Set
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913344008486912 |
|---|---|
| author | Maggi, Lorenzo Rial, Alvaro Valcarce Herzog, Aloïs Kalyanasundaram, Suresh Agrawal, Rakshak |
| author_facet | Maggi, Lorenzo Rial, Alvaro Valcarce Herzog, Aloïs Kalyanasundaram, Suresh Agrawal, Rakshak |
| contents | In 5G, the Physical Downlink Control CHannel (PDCCH) carries crucial information enabling the User Equipment (UE) to connect in UL and DL. UEs are unaware of the frequency location at which PDCCH is encoded, hence they need to perform blind decoding over a limited set of possible candidates. We address the problem faced by the gNodeB of selecting PDCCH candidates for each UE to optimize data transmission. We formulate it as a Maximum Weighted Independent Set (MWIS) problem, that is known to be an NP-hard problem and cannot even be approximated. A solution method called Weight-to-Degree Ratio (WDR) Greedy emerges as a strong contender for practical implementations due to its favorable performance-to-complexity trade-off and theoretical performance guarantees. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_04283 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | PDCCH Scheduling via Maximum Independent Set Maggi, Lorenzo Rial, Alvaro Valcarce Herzog, Aloïs Kalyanasundaram, Suresh Agrawal, Rakshak Information Theory In 5G, the Physical Downlink Control CHannel (PDCCH) carries crucial information enabling the User Equipment (UE) to connect in UL and DL. UEs are unaware of the frequency location at which PDCCH is encoded, hence they need to perform blind decoding over a limited set of possible candidates. We address the problem faced by the gNodeB of selecting PDCCH candidates for each UE to optimize data transmission. We formulate it as a Maximum Weighted Independent Set (MWIS) problem, that is known to be an NP-hard problem and cannot even be approximated. A solution method called Weight-to-Degree Ratio (WDR) Greedy emerges as a strong contender for practical implementations due to its favorable performance-to-complexity trade-off and theoretical performance guarantees. |
| title | PDCCH Scheduling via Maximum Independent Set |
| topic | Information Theory |
| url | https://arxiv.org/abs/2405.04283 |