Performance and Complexity of Sequential Decoding of PAC Codes

12/09/2020
by   Mohsen Moradi, et al.
0

Performance and complexity of sequential decoding of polarization-adjusted convolutional (PAC) codes is studied. In particular, a performance and computational complexity comparison of PAC codes with 5G polar codes and convolutional codes is given. A method for bounding the complexity of sequential decoding of PAC codes is proposed.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/08/2022

Application of Guessing to Sequential Decoding of Polarization-Adjusted Convolutional (PAC) Codes

Despite the extreme error-correction performance, the amount of computat...
12/15/2020

Performance and Complexity of the Sequential Successive Cancellation Decoding Algorithm

Simulation results illustrating the performance and complexity of the se...
02/17/2020

Polarization-adjusted Convolutional (PAC) Codes: Fano Decoding vs List Decoding

In the Shannon lecture at the 2019 International Symposium on Informatio...
02/25/2022

Approximate Weight Distribution of Polarization-Adjusted Convolutional (PAC) Codes

Polarization-adjusted convolutional (PAC) codes combine the polar and co...
10/01/2022

CRISP: Curriculum based Sequential Neural Decoders for Polar Code Family

Polar codes are widely used state-of-the-art codes for reliable communic...
01/28/2022

Sequential Decoding of Convolutional Codes for Synchronization Errors

In this work, a sequential decoder for convolutional codes over channels...
05/27/2020

List Decoding of Arikan's PAC Codes

Polar coding gives rise to the first explicit family of codes that prova...

Please sign up or login with your details

Forgot password? Click here to reset