Efficient Maximum Likelihood Decoding of Polar Codes Over the Binary Erasure Channel

06/28/2021
by   Yonatan Urman, et al.
0

A new algorithm for efficient exact maximum likelihood decoding of polar codes (which may be CRC augmented), transmitted over the binary erasure channel, is presented. The algorithm applies a matrix triangulation process on a sparse polar code parity check matrix, followed by solving a small size linear system over GF(2). To implement the matrix triangulation, we apply belief propagation decoding type operations. We also indicate how this decoder can be implemented in parallel for low latency decoding. Numerical simulations are used to evaluate the performance and computational complexity of the new algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/13/2021

Efficient Belief Propagation List Ordered Statistics Decoding of Polar Codes

New algorithms for efficient decoding of polar codes (which may be CRC-a...
research
07/01/2019

5G NR CA-Polar Maximum Likelihood Decoding by GRAND

CA-Polar codes have been selected for all control channel communications...
research
06/27/2018

Belief Propagation List Decoding of Polar Codes

We propose a belief propagation list (BPL) decoder with comparable perfo...
research
01/08/2018

Near Maximum Likelihood Decoding with Deep Learning

A novel and efficient neural decoder algorithm is proposed. The proposed...
research
06/11/2020

A PDD Decoder for Binary Linear Codes With Neural Check Polytope Projection

Linear Programming (LP) is an important decoding technique for binary li...
research
03/19/2003

A Neural Network Assembly Memory Model with Maximum-Likelihood Recall and Recognition Properties

It has been shown that a neural network model recently proposed to descr...
research
10/07/2013

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

A new iterative low complexity algorithm has been presented for computin...

Please sign up or login with your details

Forgot password? Click here to reset