Successive-Cancellation Decoding of Binary Polar Codes Based on Symmetric Parametrization

01/21/2021
by   Jun Muramatsu, et al.
0

This paper introduces algorithms for the successive-cancellation decoding and the successive-cancellation list decoding of binary polar source/channel codes. By using the symmetric parametrization of conditional probability, we reduce both space and time complexity compared to the original algorithm introduced by Tal and Vardy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/01/2017

Capacity-Achievability of Polar Codes and Precoded Polar Codes under List Decoding: They are Good both Practically and Theoretically

Polar codes under successive cancellation decoding proposed by Arıkan pr...
research
08/19/2019

Weight Distributions for Successive Cancellation Decoding of Polar Codes

In this paper, we derive the exact weight distributions for the successi...
research
05/13/2021

Input-distribution-aware parallel decoding of block codes

Many channel decoders rely on parallel decoding attempts to achieve good...
research
03/13/2018

Correct Undetected Errors with List Decoding in ARQ Error-control Systems

Undetected errors are important for linear codes, which are the only typ...
research
12/21/2018

A Complexity Reduction Method for Successive Cancellation List Decoding

This paper introduces a hardware complexity reduction method for success...
research
09/13/2018

Channel Polarization through the Lens of Blackwell Measures

Each memoryless binary-input channel (BIC) can be uniquely described by ...
research
09/10/2018

Towards Practical Software Stack Decoding of Polar Codes

The successive cancellation list decoding algorithm for polar codes yiel...

Please sign up or login with your details

Forgot password? Click here to reset