Efficient List Decoding of Convolutional Polar Codes

07/11/2020
by   Ruslan Morozov, et al.
0

An efficient implementation of min-sum SC/list decoding of convolutional polar codes is proposed. The complexity of the proposed implementation of SC decoding is more than two times smaller than the straightforward implementation. Moreover, the proposed list decoding algorithm does not require to copy any LLRs during decoding.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/10/2018

Successive Cancellation List Decoding of BMERA Codes with Application to Higher-Order Modulation

BMERA or convolutional polar codes are an extension of polar codes with ...
research
01/21/2019

SC-Fano Decoding of Polar Codes

In this paper, we present a novel decoding algorithm of a polar code, na...
research
09/22/2021

Efficient Partial Rewind of Polar Codes' Successive Cancellation-based Decoders for Re-decoding Attempts

Successive cancellation (SC) process is an essential component of variou...
research
01/14/2020

Multi-Kernel Polar Codes: Concept and Design Principles

In this paper, we propose a new polar code construction by employing ker...
research
03/21/2019

Rate-Flexible Fast Polar Decoders

Polar codes have gained extensive attention during the past few years an...
research
04/13/2021

On the efficiency of polar-like decoding for symmetric codes

The recently introduced polar codes constitute a breakthrough in coding ...
research
05/09/2022

On the Distribution of Partially Symmetric Codes for Automorphism Ensemble Decoding

Permutation list decoding recently draws attention as a possible alterna...

Please sign up or login with your details

Forgot password? Click here to reset