vix.ing · top · new · best · stats · spec

Efficient Maximum Likelihood Decoding of Polar Codes Over the Binary\n Erasure Channel

2021/06/28 by Yonatan Urman, Urman, Yonatan, David Burshtein +1 · 1 citation
Computer Science · Engineering · #Error Correcting Code Techniques #Coding theory and cryptography #Advanced Wireless Communication Techniques

paper · pdf · doi:10.48550/arxiv.2106.14753

Abstract

A new algorithm for efficient exact maximum likelihood decoding of polar\ncodes (which may be CRC augmented), transmitted over the binary erasure\nchannel, is presented. The algorithm applies a matrix triangulation process on\na sparse polar code parity check matrix, followed by solving a small size\nlinear system over GF(2). To implement the matrix triangulation, we apply\nbelief propagation decoding type operations. We also indicate how this decoder\ncan be implemented in parallel for low latency decoding. Numerical simulations\nare used to evaluate the performance and computational complexity of the new\nalgorithm.\n

Cited by

Related