Semantic Codebook-Based HARQ for Wireless Image Transmission

Semantic communication (SemCom) lies in the emphasis on ensuring the correct semantic understanding rather than error-free bit transmission. However, traditional hybrid automatic repeat request (HARQ) mechanism relies on a bit-level check, and it cannot effectively address errors at the semantic level. In this paper, we propose a semantic codebook-based HARQ (SCB-HARQ) mechanism for the reliable and efficient SemCom. To enable semantic-level error detection, SCB-HARQ leverages a shared semantic codebook trained offline at both the transmitter and receiver. This codebook serves as prior information for evaluating the distortion of received semantic features, quantifying the extent to which they deviate from the intended meaning. To reduce the transmission overhead of features in the codebook, a weighted semantic feature index (WSFI) clustering method is introduced to map features into a compact index representation. Then, a masked rate-adaptive joint source-channel coding (JSCC) method is proposed to locate and retransmit the distorted features. The simulation results demonstrate that the proposed SCB-HARQ outperforms the traditional HARQ mechanism, achieving a 46.29% improvement in image reconstruction performance while reducing the transmission data volume by 51.27%.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Communications
Published
2025-08-29
DOI
https://doi.org/10.1109/tcomm.2025.3604326
Primary Topic
Advanced Data Compression Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Semantic Codebook-Based HARQ for Wireless Image Transmission

Qimei Cui, Guanhao Liang, Yao Sun, Ji Zhang et al.
IEEE Transactions on Communications
Advanced Data Compression Techniques
article

Semantic Codebook-Based HARQ for Wireless Image Transmission

Qimei Cui, Guanhao Liang, Yao Sun, Ji Zhang, Xiaofeng Tao, Xuefei Zhang
article en

Abstract

Semantic communication (SemCom) lies in the emphasis on ensuring the correct semantic understanding rather than error-free bit transmission. However, traditional hybrid automatic repeat request (HARQ) mechanism relies on a bit-level check, and it cannot effectively address errors at the semantic level. In this paper, we propose a semantic codebook-based HARQ (SCB-HARQ) mechanism for the reliable and efficient SemCom. To enable semantic-level error detection, SCB-HARQ leverages a shared semantic codebook trained offline at both the transmitter and receiver. This codebook serves as prior information for evaluating the distortion of received semantic features, quantifying the extent to which they deviate from the intended meaning. To reduce the transmission overhead of features in the codebook, a weighted semantic feature index (WSFI) clustering method is introduced to map features into a compact index representation. Then, a masked rate-adaptive joint source-channel coding (JSCC) method is proposed to locate and retransmit the distorted features. The simulation results demonstrate that the proposed SCB-HARQ outperforms the traditional HARQ mechanism, achieving a 46.29% improvement in image reconstruction performance while reducing the transmission data volume by 51.27%.

IEEE Transactions on CommunicationsVol. 73(12)
Beijing University of Posts and Telecommunications (CN), Gorgias Press (United States) (US), China Telecom (China) (CN), University of Glasgow (GB)
National Key Research and Development Program of China
Affordable and clean energy
Openalex Percentile: Top 78%
Advanced Data Compression Techniques
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.