Fundamental Limitation of Semantic Communications: Neural Estimation for Rate-Distortion

Dongxu Li, Jianhao Huang, Chuan Huang, Xiaoqi Qin, Han Zhang +1 more
1/2/2024
cs.ITcs.LGeess.SP

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

This paper studies the fundamental limit of semantic communications over the discrete memoryless channel. We consider the scenario to send a semantic source consisting of an observation state and its corresponding semantic state, both of which are recovered at the receiver. To derive the performance limitation, we adopt the semantic rate-distortion function (SRDF) to study the relationship among the minimum compression rate, observation distortion, semantic distortion, and channel capacity. For the case with unknown semantic source distribution, while only a set of the source samples is available, we propose a neural-network-based method by leveraging the generative networks to learn the semantic source distribution. Furthermore, for a special case where the semantic state is a deterministic function of the observation, we design a cascade neural network to estimate the SRDF. For the case with perfectly known semantic source distribution, we propose a general Blahut-Arimoto algorithm to effectively compute the SRDF. Finally, experimental results validate our proposed algorithms for the scenarios with ideal Gaussian semantic source and some practical datasets.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{li2024fundamental,
  title  = {Fundamental Limitation of Semantic Communications: Neural Estimation for Rate-Distortion},
  author = {Dongxu Li and Jianhao Huang and Chuan Huang and Xiaoqi Qin and Han Zhang and Ping Zhang},
  year   = {2024},
  eprint = {2401.01176},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.01176v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.01176.svg)](https://codeofpaper.com/paper/2401.01176)

Discussion