Low-Complexity Sparse Superimposed Coding for Ultra Reliable Low Latency Communications

TL;DR

This paper introduces a low-complexity sparse superimposed coding scheme for ultra-reliable low latency communications, reducing computational complexity while maintaining strong performance in short-packet transmission scenarios.

Contribution

It proposes a novel sparse codebook design and decoding method that significantly lowers complexity compared to traditional dense SSC schemes.

Findings

Achieves a favorable trade-off between BLER and complexity.

Exhibits robustness across various transmission block lengths.

Reduces encoding and decoding complexity through sparsity.

Abstract

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.