Low-Complexity Sparse Superimposed Coding for Ultra Reliable Low Latency Communications
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915747591094272 |
|---|---|
| author | Zhang, Yanfeng Fan, Xi'an Zhu, Xu Zheng, Jinkai Liang, Hui Yang, Weiwei Luan, Tom H. |
| author_facet | Zhang, Yanfeng Fan, Xi'an Zhu, Xu Zheng, Jinkai Liang, Hui Yang, Weiwei Luan, Tom H. |
| contents | Sparse superimposed coding (SSC) has emerged as a promising technique for short-packet transmission in ultra-reliable low-latency communication scenarios. However, conventional SSC schemes often suffer from high encoding and decoding complexity due to the use of dense codebook matrices. In this paper, we propose a low-complexity SSC scheme by designing a sparse codebook structure, where each codeword contains only a small number of non-zero elements. The decoding is performed using the traditional multipath matching pursuit algorithm, and the overall complexity is significantly reduced by exploiting the sparsity of the codebook. Simulation results show that the proposed scheme achieves a favorable trade-off between BLER performance and computational complexity, and exhibits strong robustness across different transmission block lengths. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_16012 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Low-Complexity Sparse Superimposed Coding for Ultra Reliable Low Latency Communications Zhang, Yanfeng Fan, Xi'an Zhu, Xu Zheng, Jinkai Liang, Hui Yang, Weiwei Luan, Tom H. Signal Processing Sparse superimposed coding (SSC) has emerged as a promising technique for short-packet transmission in ultra-reliable low-latency communication scenarios. However, conventional SSC schemes often suffer from high encoding and decoding complexity due to the use of dense codebook matrices. In this paper, we propose a low-complexity SSC scheme by designing a sparse codebook structure, where each codeword contains only a small number of non-zero elements. The decoding is performed using the traditional multipath matching pursuit algorithm, and the overall complexity is significantly reduced by exploiting the sparsity of the codebook. Simulation results show that the proposed scheme achieves a favorable trade-off between BLER performance and computational complexity, and exhibits strong robustness across different transmission block lengths. |
| title | Low-Complexity Sparse Superimposed Coding for Ultra Reliable Low Latency Communications |
| topic | Signal Processing |
| url | https://arxiv.org/abs/2601.16012 |