Rate-Splitting Multiple Access for Semantic-Aware Networks: an Age of Incorrect Information Perspective
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909119617695744 |
|---|---|
| author | Dizdar, Onur Wang, Stephen |
| author_facet | Dizdar, Onur Wang, Stephen |
| contents | In this letter, we design a downlink multi-user communication framework based on Rate-Splitting Multiple Access (RSMA) for semantic-aware networks. First, we formulate an optimization problem to obtain the optimal user scheduling, precoding, and power allocation schemes jointly. We consider the metric Age of Incorrect Information (AoII) in the objective function of the formulated problem to maximize the freshness of the overall information to be transmitted. Using big-M and Successive Convex Approximation (SCA) methods, we convert the resulting non-convex problem with conditional objective and constraints into a convex one and propose an iterative algorithm to solve it. By numerical results, we show that RSMA achieves a lower AoII than SDMA owing to its superior performance under multi-user interference. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_07159 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Rate-Splitting Multiple Access for Semantic-Aware Networks: an Age of Incorrect Information Perspective Dizdar, Onur Wang, Stephen Information Theory In this letter, we design a downlink multi-user communication framework based on Rate-Splitting Multiple Access (RSMA) for semantic-aware networks. First, we formulate an optimization problem to obtain the optimal user scheduling, precoding, and power allocation schemes jointly. We consider the metric Age of Incorrect Information (AoII) in the objective function of the formulated problem to maximize the freshness of the overall information to be transmitted. Using big-M and Successive Convex Approximation (SCA) methods, we convert the resulting non-convex problem with conditional objective and constraints into a convex one and propose an iterative algorithm to solve it. By numerical results, we show that RSMA achieves a lower AoII than SDMA owing to its superior performance under multi-user interference. |
| title | Rate-Splitting Multiple Access for Semantic-Aware Networks: an Age of Incorrect Information Perspective |
| topic | Information Theory |
| url | https://arxiv.org/abs/2312.07159 |