Sparse superposition codes with rotational invariant coding matrices for memoryless channels

05/18/2022
by   Yuhao Liu, et al.
0

We recently showed in [1] the superiority of certain structured coding matrices ensembles (such as partial row-orthogonal) for sparse superposition codes when compared with purely random matrices with i.i.d. entries, both information-theoretically and under practical vector approximate message-passing decoding. Here we generalize this result to binary input channels under generalized vector approximate message-passing decoding [2].We focus on specific binary output channels for concreteness but our analysis based on the replica symmetric method from statistical physics applies to any memoryless channel. We confirm that the "spectral criterion" introduced in [1], a coding-matrix design principle which allows the code to be capacity-achieving in the "large section size" asymptotic limit, extends to generic memoryless channels. Moreover, we also show that the vanishing error floor property [3] of this coding scheme is universal for arbitrary spectrum of the coding matrix.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
03/15/2023

Capacity-Achieving Sparse Regression Codes via Vector Approximate Message Passing

Sparse regression codes (SPARCs) are a promising coding scheme that can ...
research
03/09/2021

Error-and-Erasure Decoding of Product and Staircase Codes

High-rate product codes (PCs) and staircase codes (SCs) are ubiquitous c...
research
02/12/2020

Compressed Coding, AMP Based Decoding and Analog Spatial Coupling

This paper considers a compressed coding (CC) scheme that combines compr...
research
12/01/2017

A New Coding/Decoding Algorithm using Fibonacci Numbers

In this paper we present a new method of coding/decoding algorithms usin...
research
01/23/2023

The k-XORSAT threshold revisited

We provide a simplified proof of the random k-XORSAT satisfiability thre...

Please sign up or login with your details

Forgot password? Click here to reset