Beamforming Design for Semantic-Bit Coexisting Communication System
IEEE Journal on Selected Areas in Communications · 2025-04 · 43 (4) · 1262-1277
DOI: 10.1109/jsac.2025.3531537 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Journal on Selected Areas in Communications, 2025-04. Verfasst von Maojun Zhang und 6 weiteren Autor:innen. Die Arbeit wurde bisher 26-mal zitiert (Crossref) und nennt 50 Literaturangaben. Gefördert von: National Natural Science Foundation of China, Zhejiang Provincial Natural Science Foundation of China, Guangdong Major Project of Basic and Applied Basic Research.
Abstract (Originalsprache)
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.
Förderung
- National Natural Science Foundation of China
- Zhejiang Provincial Natural Science Foundation of China
- Guangdong Major Project of Basic and Applied Basic Research
- Guangdong Basic and Applied Basic Research Foundation
- Shenzhen-Hong Kong-Macau Technology Research Programme
- Longgang District Special Funds for Science and Technology Innovation
- Natural Science Foundation of China
- NSFC
Zitieren
APA
Zhang, M., Zhu, G., Jin, R., Chen, X., Shi, Q., Zhong, C., & Huang, K. (2025). Beamforming Design for Semantic-Bit Coexisting Communication System. IEEE Journal on Selected Areas in Communications, 43(4), 1262-1277. https://doi.org/10.1109/jsac.2025.3531537
Vancouver
Zhang M, Zhu G, Jin R, Chen X, Shi Q, Zhong C, et al. Beamforming Design for Semantic-Bit Coexisting Communication System. IEEE Journal on Selected Areas in Communications. 2025;43(4):1262-1277. doi:10.1109/jsac.2025.3531537
BibTeX
@article{Zhang2025,
author = {Zhang, Maojun and Zhu, Guangxu and Jin, Richeng and Chen, Xiaoming and Shi, Qingjiang and Zhong, Caijun and Huang, Kaibin},
title = {Beamforming Design for Semantic-Bit Coexisting Communication System},
journal = {IEEE Journal on Selected Areas in Communications},
year = {2025},
volume = {43},
number = {4},
pages = {1262--1277},
doi = {10.1109/jsac.2025.3531537}
}
EUVIMED