Codes approaching the Shannon limit with polynomial complexity per information bit

01/25/2021
by   Ilya Dumer, et al.
0

We consider codes for channels with extreme noise that emerge in various low-power applications. Simple LDPC-type codes with parity checks of weight 3 are first studied for any dimension m→∞. These codes form modulation schemes: they improve the original channel output for any SNR> -6 dB (per information bit) and gain 3 dB over uncoded modulation as SNR grows. However, they also have a floor on the output bit error rate (BER) irrespective of their length. Tight lower and upper bounds, which are virtually identical to simulation results, are then obtained for BER at any SNR. We also study a combined scheme that splits m information bits into b blocks and protects each with some polar code. Decoding moves back and forth between polar and LDPC codes, every time using a polar code of a higher rate. For a sufficiently large constant b and m→∞, this design yields a vanishing BER at any SNR that is arbitrarily close to the Shannon limit of -1.59 dB. Unlike other existing designs, this scheme has polynomial complexity of order mln m per information bit.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2020

Selectively Precoded Polar Codes

In this paper, we propose selectively precoded polar (SPP) code, built o...
research
11/19/2022

Comparison of different coding schemes for 1-bit ADC

This paper devotes to comparison of different coding schemes (various co...
research
01/18/2022

Improved Receivers for Optical Wireless OFDM: An Information Theoretic Perspective

We consider performance enhancement of asymmetrically-clipped optical or...
research
03/08/2020

Shannon-Limit Approached Information Reconciliation for Quantum Key Distribution

Information reconciliation (IR) corrects the errors in sifted keys and e...
research
02/04/2018

Repeat-Accumulate Signal Codes

We propose a new state-constrained signal code, namely repeat-accumulate...
research
07/21/2020

Towards Quantum Belief Propagation for LDPC Decoding in Wireless Networks

We present Quantum Belief Propagation (QBP), a Quantum Annealing (QA) ba...
research
11/03/2021

Tensor Decomposition Bounds for TBM-Based Massive Access

Tensor-based modulation (TBM) has been proposed in the context of unsour...

Please sign up or login with your details

Forgot password? Click here to reset