# A Joint Communication and Computation Design for Probabilistic Semantic Communications

arXiv: https://arxiv.org/abs/2402.16328 · HTML: https://mlsanity.com/paper/2402.16328/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 26 Feb 2024.

## Built on by (most cited first, 4 of 4)

- [Latency-Aware Generative Semantic Communications with Pre-Trained Diffusion Models](https://mlsanity.com/paper/2403.17256/) (2024)
- [Semantic Meta-Split Learning: A TinyML Scheme for Few-Shot Wireless Image Classification](https://mlsanity.com/paper/2409.12978/) (2024)
- [Hypergame Theory for Decentralized Resource Allocation in Multi-user Semantic Communications](https://mlsanity.com/paper/2409.17985/) (2024)
- [Semantic-Aware Visual Information Transmission With Key Information Extraction Over Wireless Networks](https://mlsanity.com/paper/2506.12786/) (2025)

## Abstract (arXiv)

In this paper, the problem of joint transmission and computation resource allocation for a multi-user probabilistic semantic communication (PSC) network is investigated. In the considered model, users employ semantic information extraction techniques to compress their large-sized data before transmitting them to a multi-antenna base station (BS). Our model represents large-sized data through substantial knowledge graphs, utilizing shared probability graphs between the users and the BS for efficient semantic compression. The resource allocation problem is formulated as an optimization problem with the objective of maximizing the sum of equivalent rate of all users, considering total power budget and semantic resource limit constraints. The computation load considered in the PSC network is formulated as a non-smooth piecewise function with respect to the semantic compression ratio. To tackle this non-convex non-smooth optimization challenge, a three-stage algorithm is proposed where the solutions for the receive beamforming matrix of the BS, transmit power of each user, and semantic compression ratio of each user are obtained stage by stage. Numerical results validate the effectiveness of our proposed scheme.