Using List Decoding to Improve the Finite-Length Performance of Sparse Regression Codes

10/31/2020
by   Haiwen Cao, et al.
0

We consider sparse superposition codes (SPARCs) over complex AWGN channels. Such codes can be efficiently decoded by an approximate message passing (AMP) decoder, whose performance can be predicted via so-called state evolution in the large-system limit. In this paper, we mainly focus on how to use concatenation of SPARCs and cyclic redundancy check (CRC) codes on the encoding side and use list decoding on the decoding side to improve the finite-length performance of the AMP decoder for SPARCs over complex AWGN channels. Simulation results show that such a concatenated coding scheme works much better than SPARCs with the original AMP decoder and results in a steep waterfall-like behavior in the bit-error rate performance curves. Besides that, we also introduce a novel class of design matrices, i.e., matrices that describe the encoding process, based on circulant matrices derived from Frank or from Milewski sequences. This class of design matrices has comparable encoding and decoding computational complexity as well as very close performance with the commonly-used class of design matrices based on discrete Fourier transform (DFT) matrices, but gives us more degrees of freedom when designing SPARCs for various applications.

READ FULL TEXT
research
01/23/2015

Capacity-achieving Sparse Superposition Codes via Approximate Message Passing Decoding

Sparse superposition codes were recently introduced by Barron and Joseph...
research
03/24/2023

Generalized Sparse Regression Codes for Short Block Lengths

Sparse regression codes (SPARC) connect the sparse signal recovery frame...
research
11/27/2019

Finite-length performance comparison of network codes using random vs Pascal matrices

In this letter, we evaluate the finite-length performance of network cod...
research
02/09/2022

Sparse superposition codes under VAMP decoding with generic rotational invariant coding matrices

Sparse superposition codes were originally proposed as a capacity-achiev...
research
12/19/2021

List Autoencoder: Towards Deep Learning Based Reliable Transmission Over Noisy Channels

There has been a growing interest in automating the design of channel en...
research
07/03/2019

An Encoding-Decoding algorithm based on Padovan numbers

In this paper, we propose a new of coding/decoding algorithm using Padov...

Please sign up or login with your details

Forgot password? Click here to reset