A Joint Communication and Computation Design for Semantic Wireless Communication with Probability Graph

TL;DR

The paper addresses efficient semantic wireless communication by representing shared semantic knowledge as a probability graph that enables compression of semantic information at the BS and reliable recovery at the user. It derives both communication and computation cost models and formulates a joint energy-minimization problem subject to latency and semantic constraints, solving it via a closed-form power expression and a linear-search over the omission count $E$. The proposed Joint Communication and Computation for Probability Graph (JCCPG) method demonstrates energy savings over traditional, non-semantic schemes, with computational energy generally lower than communication energy and performance advantages increasing under tight latency or poor channel conditions. This approach offers a practical framework for semantic-aware wireless systems and highlights avenues for dynamic graph updates and multi-user extensions.

Abstract

In this paper, we delve into the challenge of optimizing joint communication and computation for semantic communication over wireless networks using a probability graph framework. In the considered model, the base station (BS) extracts the small-sized compressed semantic information through removing redundant messages based on the stored knowledge base. Specifically, the knowledge base is encapsulated in a probability graph that encapsulates statistical relations. At the user side, the compressed information is accurately deduced using the same probability graph employed by the BS. While this approach introduces an additional computational overhead for semantic information extraction, it significantly curtails communication resource consumption by transmitting concise data. We derive both communication and computation cost models based on the inference process of the probability graph. Building upon these models, we introduce a joint communication and computation resource allocation problem aimed at minimizing the overall energy consumption of the network, while accounting for latency, power, and semantic constraints. To address this problem, we obtain a closed-form solution for transmission power under a fixed semantic compression ratio. Subsequently, we propose an efficient linear search-based algorithm to attain the optimal solution for the considered problem with low computational complexity. Simulation results underscore the effectiveness of our proposed system, showcasing notable improvements compared to conventional non-semantic schemes.

Figures (11)

• Figure 1: An example of knowledge graph.
• Figure 2: The process of extracting semantic triples from text data.
• Figure 3: An illustration of the considered semantic communication system.
• Figure 4: Illustration of the probability graph considered in the semantic communication system.
• Figure 5: An illustration of the information compression based on the probability graph.