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

TL;DR

This paper presents improved algorithms for decoding binary polar codes using symmetric parametrization, reducing computational complexity while maintaining decoding performance.

Contribution

It introduces symmetric parametrization-based algorithms for successive-cancellation decoding, enhancing efficiency over previous methods.

Findings

Reduced space complexity in decoding algorithms

Lowered time complexity compared to original algorithms

Maintained decoding accuracy with improved efficiency

Abstract

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.