论文标题

针对任务通信的适应性语义压缩和资源分配

Adaptable Semantic Compression and Resource Allocation for Task-Oriented Communications

论文作者

Liu, Chuanhong, Guo, Caili, Yang, Yang, Jiang, Nan

论文摘要

以任务为导向的通信是一种新的范式,旨在提供有效的连通性来完成智能任务,而不是接收每个传输位。在本文中,提出了一个基于深度学习的深度以任务的通信体系结构,用户以端到端(E2E)方式提取,压缩和传输语义。此外,提出了一种方法,可以根据其与任务相关的重要性来压缩语义,即适应性的语义压缩(ASC)。假设有一个延迟智能系统,支持多个用户表示一个问题,即以较高的压缩比执行的问题需要更少的频道资源,但会导致语义的扭曲,而使用较低的压缩比进行执行,则需要更多的频道资源,因此可能导致由于延迟约束而导致变速箱失败。为了解决该问题,压缩比和资源分配均针对以任务为导向的通信系统进行了优化,以最大程度地提高任务的成功概率。具体而言,由于问题的非概念性,我们提出了一种压缩比和资源分配(CRRA)算法,通过将问题分为两个子问题并迭代以获得收敛解决方案而解决。此外,考虑用户具有各种服务级别的方案,提议提出压缩比,资源分配和用户选择(CRRAUS)算法来解决问题。在CRRAUS中,选择用户可以根据分支和界限方法进行自适应以完成相应的智能任务,而与CRRA相比,用户以较高的算法复杂性为代价。仿真结果表明,拟议的CRRA和CRRAUS算法可以分别获得至少15%和10%的成功收益。

Task-oriented communication is a new paradigm that aims at providing efficient connectivity for accomplishing intelligent tasks rather than the reception of every transmitted bit. In this paper, a deep learning-based task-oriented communication architecture is proposed where the user extracts, compresses and transmits semantics in an end-to-end (E2E) manner. Furthermore, an approach is proposed to compress the semantics according to their importance relevant to the task, namely, adaptable semantic compression (ASC). Assuming a delay-intolerant system, supporting multiple users indicates a problem that executing with the higher compression ratio requires fewer channel resources but leads to the distortion of semantics, while executing with the lower compression ratio requires more channel resources and thus may lead to a transmission failure due to delay constraint. To solve the problem, both compression ratio and resource allocation are optimized for the task-oriented communication system to maximize the success probability of tasks. Specifically, due to the nonconvexity of the problem, we propose a compression ratio and resource allocation (CRRA) algorithm by separating the problem into two subproblems and solving iteratively to obtain the convergent solution. Furthermore, considering the scenarios where users have various service levels, a compression ratio, resource allocation, and user selection (CRRAUS) algorithm is proposed to deal with the problem. In CRRAUS, users are adaptively selected to complete the corresponding intelligent tasks based on branch and bound method at the expense of higher algorithm complexity compared with CRRA. Simulation results show that the proposed CRRA and CRRAUS algorithms can obtain at least 15% and 10% success gains over baseline algorithms, respectively.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源