Beamforming Design for Semantic-Bit Coexisting Communication System

Maojun Zhang;Guangxu Zhu;Richeng Jin;Xiaoming Chen;Qingjiang Shi;Caijun Zhong;Kaibin Huang
{"title":"Beamforming Design for Semantic-Bit Coexisting Communication System","authors":"Maojun Zhang;Guangxu Zhu;Richeng Jin;Xiaoming Chen;Qingjiang Shi;Caijun Zhong;Kaibin Huang","doi":"10.1109/JSAC.2025.3531537","DOIUrl":null,"url":null,"abstract":"Semantic communication (SemCom) is emerging as a key technology for future sixth-generation (6G) systems. Unlike traditional bit-level communication (BitCom), SemCom directly optimizes performance at the semantic level, leading to superior communication efficiency. Nevertheless, the task-oriented nature of SemCom renders it challenging to completely replace BitCom. Consequently, it is desired to consider a semantic-bit coexisting communication system, where a base station (BS) serves SemCom users (sem-users) and BitCom users (bit-users) simultaneously. Such a system faces severe and heterogeneous inter-user interference. In this context, this paper provides a new semantic-bit coexisting communication framework and proposes a spatial beamforming scheme to accommodate both types of users. Specifically, we consider maximizing the semantic rate for semantic users while ensuring the quality-of-service (QoS) requirements for bit-users. Due to the intractability of obtaining the exact closed-form expression of the semantic rate, a data driven method is first applied to attain an approximated expression via data fitting. With the resulting complex transcendental function, majorization minimization (MM) is adopted to convert the original formulated problem into a multiple-ratio problem, which allows fractional programming (FP) to be used to further transform the problem into an inhomogeneous quadratically constrained quadratic programs (QCQP) problem. Solving the problem leads to a semi-closed form solution with undetermined Lagrangian factors that can be updated by a fixed point algorithm. This method is referred to as the MM-FP algorithm. Additionally, inspired by the semi-closed form solution, we also propose a low-complexity version of the MM-FP algorithm, called the low-complexity MM-FP (LP-MM-FP), which alleviates the need for iterative optimization of beamforming vectors. Extensive simulation results demonstrate that the proposed MM-FP algorithm outperforms conventional beamforming algorithms such as zero-forcing (ZF), maximum ratio transmission (MRT), and weighted minimum mean-square error (WMMSE). Moreover, the proposed LP-MMFP algorithm achieves comparable performance with the WMMSE algorithm but with lower computational complexity.","PeriodicalId":73294,"journal":{"name":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","volume":"43 4","pages":"1262-1277"},"PeriodicalIF":17.2000,"publicationDate":"2025-01-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE journal on selected areas in communications : a publication of the IEEE Communications Society","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10845882/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Semantic communication (SemCom) is emerging as a key technology for future sixth-generation (6G) systems. Unlike traditional bit-level communication (BitCom), SemCom directly optimizes performance at the semantic level, leading to superior communication efficiency. Nevertheless, the task-oriented nature of SemCom renders it challenging to completely replace BitCom. Consequently, it is desired to consider a semantic-bit coexisting communication system, where a base station (BS) serves SemCom users (sem-users) and BitCom users (bit-users) simultaneously. Such a system faces severe and heterogeneous inter-user interference. In this context, this paper provides a new semantic-bit coexisting communication framework and proposes a spatial beamforming scheme to accommodate both types of users. Specifically, we consider maximizing the semantic rate for semantic users while ensuring the quality-of-service (QoS) requirements for bit-users. Due to the intractability of obtaining the exact closed-form expression of the semantic rate, a data driven method is first applied to attain an approximated expression via data fitting. With the resulting complex transcendental function, majorization minimization (MM) is adopted to convert the original formulated problem into a multiple-ratio problem, which allows fractional programming (FP) to be used to further transform the problem into an inhomogeneous quadratically constrained quadratic programs (QCQP) problem. Solving the problem leads to a semi-closed form solution with undetermined Lagrangian factors that can be updated by a fixed point algorithm. This method is referred to as the MM-FP algorithm. Additionally, inspired by the semi-closed form solution, we also propose a low-complexity version of the MM-FP algorithm, called the low-complexity MM-FP (LP-MM-FP), which alleviates the need for iterative optimization of beamforming vectors. Extensive simulation results demonstrate that the proposed MM-FP algorithm outperforms conventional beamforming algorithms such as zero-forcing (ZF), maximum ratio transmission (MRT), and weighted minimum mean-square error (WMMSE). Moreover, the proposed LP-MMFP algorithm achieves comparable performance with the WMMSE algorithm but with lower computational complexity.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
语义位共存通信系统的波束形成设计
语义通信(SemCom)正在成为未来第六代(6G)系统的关键技术。与传统的比特级通信(BitCom)不同,SemCom直接在语义级优化性能,从而提高了通信效率。然而,SemCom的任务导向特性使得它很难完全取代BitCom。因此,需要考虑一个语义位共存的通信系统,其中基站(BS)同时服务SemCom用户(SemCom -users)和BitCom用户(bit-users)。这样的系统面临着严重的、异构的用户间干扰。在此背景下,本文提出了一种新的语义位共存通信框架,并提出了一种空间波束形成方案,以适应这两种类型的用户。具体来说,我们考虑最大化语义用户的语义速率,同时确保比特用户的服务质量(QoS)要求。由于难以获得语义率的精确封闭表达式,首先采用数据驱动方法,通过数据拟合获得近似表达式。利用所得到的复超越函数,利用最大极小化(MM)将原公式问题转化为多比问题,从而利用分数规划(FP)将问题进一步转化为非齐次二次约束二次规划(QCQP)问题。求解该问题可得到一个具有待定拉格朗日因子的半封闭解,该解可通过不动点算法更新。这种方法称为MM-FP算法。此外,受半封闭形式解的启发,我们还提出了一种低复杂度的MM-FP算法,称为低复杂度MM-FP (LP-MM-FP),该算法减轻了波束形成矢量迭代优化的需要。大量的仿真结果表明,MM-FP算法优于传统的波束形成算法,如零强迫(ZF)、最大比传输(MRT)和加权最小均方误差(WMMSE)。此外,本文提出的LP-MMFP算法与WMMSE算法性能相当,但计算复杂度较低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Precise RF-Vision Fusion UAV Positioning and Identification for 6G Spectrum Security IRS-Aided Secure Sensing for Surveillance Area Coverage: Framework and Algorithm Design Adaptive Learning for IRS-Assisted Wireless Networks: Securing Opportunistic Communications Against Byzantine Eavesdroppers Block ModShift: Model Privacy via Dynamic Designed Shifts Physical Layer Security for Sensing-Communication-Computing-Control Closed Loop: A Systematic Security Perspective
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1