Semantic Communication over Sparse Code Multiple Access Systems

Semantic communication focuses on transmitting semantic meanings, with a significant characteristic being the differentiation of the importance of information, thereby improving communication efficiency. Sparse Code Multiple Access (SCMA) is a code-domain Non-Orthogonal Multiple Access (NOMA) technique. Compared to traditional orthogonal access technologies, SCMA can support more user connections and achieve higher system capacity. In this paper, we propose a SCMA-based semantic communication framework, where the hierarchical transmission of SCMA can be effectively integrated with the importance of semantic information. The Message Passing Algorithm (MPA) is the most commonly used detection method in SCMA, but its computational complexity increases significantly as the codebook size grows. This paper introduces an improved SCMA codebook for semantic communication, which adjusts the transmission quality of each information layer in SCMA based on the importance of the semantic information, while significantly reducing detection complexity. Additionally, a low-complexity detection method and its corresponding logarithmic-domain algorithm are proposed. Simulation results show that the improved codebook outperforms traditional designs in Multi-Scale Structural Similarity (MS-SSIM), effectively recovering semantic information at low signal-to-noise ratios, while significantly reducing detection complexity.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1109/iccworkshops67674.2025.11162335
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Semantic Communication over Sparse Code Multiple Access Systems

Jianhao Hu, Kaining Han, Qiushi Wang, Xian Wang et al.
IoT and Edge/Fog Computing
article

Semantic Communication over Sparse Code Multiple Access Systems

Jianhao Hu, Kaining Han, Qiushi Wang, Xian Wang, Jia'ao Liang, Tianzhu Qin
article en

Abstract

Semantic communication focuses on transmitting semantic meanings, with a significant characteristic being the differentiation of the importance of information, thereby improving communication efficiency. Sparse Code Multiple Access (SCMA) is a code-domain Non-Orthogonal Multiple Access (NOMA) technique. Compared to traditional orthogonal access technologies, SCMA can support more user connections and achieve higher system capacity. In this paper, we propose a SCMA-based semantic communication framework, where the hierarchical transmission of SCMA can be effectively integrated with the importance of semantic information. The Message Passing Algorithm (MPA) is the most commonly used detection method in SCMA, but its computational complexity increases significantly as the codebook size grows. This paper introduces an improved SCMA codebook for semantic communication, which adjusts the transmission quality of each information layer in SCMA based on the importance of the semantic information, while significantly reducing detection complexity. Additionally, a low-complexity detection method and its corresponding logarithmic-domain algorithm are proposed. Simulation results show that the improved codebook outperforms traditional designs in Multi-Scale Structural Similarity (MS-SSIM), effectively recovering semantic information at low signal-to-noise ratios, while significantly reducing detection complexity.

University of Electronic Science and Technology of China (CN)
Openalex Percentile: Top 70%
IoT and Edge/Fog Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.