Compression Ratio Allocation for Probabilistic Semantic Communication With RSMA

Semantic communication is envisioned as a key technology for future wireless networks due to its high communication efficiency. However, research combining semantic communication and advanced multiple access techniques, such as rate splitting multiple access (RSMA), is still lacking. In this paper, the problem of joint communication and computation resource allocation for probabilistic semantic communication (PSCom) with RSMA is investigated. In the considered model, the base station (BS) needs to transmit a large amount of data to multiple users with 1-layer RSMA. Due to limited communication resources, the BS is required to utilize semantic communication techniques to compress the original data. In this paper, we utilize knowledge graphs to represent semantic information and employ probabilistic graphs, which are shared between the BS and users, to further compress the knowledge graphs. The BS can use the probabilistic graph to compress the data to be transmitted, while the user can recover the compressed semantic information using the same shared probabilistic graph. The additional computation power required for semantic information compression inevitably results in a reduction in transmission power due to the limited total power budget. Considering the effect of semantic compression ratio, the semantic rate expression for RSMA is first obtained. Then, based on the obtained rate expression, an optimization problem is formulated with the aim of maximizing the sum of semantic rates of all users under total power, semantic compression ratio, and rate allocation constraints. To tackle this problem, an iterative algorithm is proposed, where the semantic compression ratio subproblem is addressed using a greedy algorithm, and the rate allocation and transmit beamforming design subproblem is solved using a successive convex approximation method. Numerical results validate the effectiveness of the proposed scheme.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Communications
Published
2025-03-06
DOI
https://doi.org/10.1109/tcomm.2025.3548689
Citations
26
Primary Topic
Advanced Data Compression Techniques
Type
article
Field-Weighted Citation Impact
33.18
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Compression Ratio Allocation for Probabilistic Semantic Communication With RSMA

Kaibin Huang, Wei Xu, Zhouxiang Zhao, Ye Hu et al.
26 citations
IEEE Transactions on Communications
Advanced Data Compression Techniques
33.18
article

Compression Ratio Allocation for Probabilistic Semantic Communication With RSMA

Kaibin Huang, Wei Xu, Zhouxiang Zhao, Ye Hu, Chen Zhu, Zhaohui Yang, Mohammad Shikh‐Bahaei, Zhaoyang Zhang
article en
26 citations

Abstract

Semantic communication is envisioned as a key technology for future wireless networks due to its high communication efficiency. However, research combining semantic communication and advanced multiple access techniques, such as rate splitting multiple access (RSMA), is still lacking. In this paper, the problem of joint communication and computation resource allocation for probabilistic semantic communication (PSCom) with RSMA is investigated. In the considered model, the base station (BS) needs to transmit a large amount of data to multiple users with 1-layer RSMA. Due to limited communication resources, the BS is required to utilize semantic communication techniques to compress the original data. In this paper, we utilize knowledge graphs to represent semantic information and employ probabilistic graphs, which are shared between the BS and users, to further compress the knowledge graphs. The BS can use the probabilistic graph to compress the data to be transmitted, while the user can recover the compressed semantic information using the same shared probabilistic graph. The additional computation power required for semantic information compression inevitably results in a reduction in transmission power due to the limited total power budget. Considering the effect of semantic compression ratio, the semantic rate expression for RSMA is first obtained. Then, based on the obtained rate expression, an optimization problem is formulated with the aim of maximizing the sum of semantic rates of all users under total power, semantic compression ratio, and rate allocation constraints. To tackle this problem, an iterative algorithm is proposed, where the semantic compression ratio subproblem is addressed using a greedy algorithm, and the rate allocation and transmit beamforming design subproblem is solved using a successive convex approximation method. Numerical results validate the effectiveness of the proposed scheme.

IEEE Transactions on CommunicationsVol. 73(9)
University of Miami (US), King's College London (GB), Hangzhou Wanxiang Polytechnic (CN), Zhejiang University (CN), Southeast University (CN), University of Hong Kong (HK)
Openalex Percentile: Top 0%
Advanced Data Compression Techniques
33.18
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.