Performance and Complexity of the Sequential Successive Cancellation Decoding Algorithm

12/15/2020
by   Peter Trifonov, et al.
0

Simulation results illustrating the performance and complexity of the sequential successive cancellation decoding algorithm are presented for the case of polar subcodes with Arikan and large kernels, as well as for extended BCH codes. Performance comparison with Arikan PAC and LDPC codes is provided. Furthermore, complete description of the decoding algorithm is presented.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/09/2020

Performance and Complexity of Sequential Decoding of PAC Codes

Performance and complexity of sequential decoding of polarization-adjust...
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
11/01/2021

Noise Error Pattern Generation Based on Successive Addition-Subtraction for Guessing Decoding

Guessing random additive noise decoding (GRAND) algorithm has emerged as...
research
01/19/2018

Chained Successive Cancellation Decoding of the Extended Golay code

The extended Golay code is shown to be representable as a chained polar ...
research
01/20/2021

Recursive Trellis Processing of Large Polarization Kernels

A reduced complexity algorithm is presented for computing the log-likeli...
research
03/28/2019

Successive-Cancellation Decoding of Linear Source Code

This paper investigates the error probability of several decoding method...
research
12/15/2022

Successive Interference Cancellation for Fiber-Optic Channels with Direct Detection

Two simplified transceiver architectures are studied for fiber-optic lin...

Please sign up or login with your details

Forgot password? Click here to reset