Binary Polar Codes Based on Bit Error Probability

01/22/2021
by   Jun Muramatsu, et al.
0

This paper revisits the theory of binary polar source/channel codes based on the bit error probability of successive-cancellation decoding. The polarization theorem is introduced based on the bit error probability and then techniques to compute the bit error probability are introduced. These techniques can be applied to the construction of polar codes and the computation of an upper bound of the block decoding error probability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/15/2022

Performance and Construction of Polar Codes: The Perspective of Bit Error Probability

Most existing works of polar codes focus on the analysis of block error ...
research
11/06/2021

Non-Binary Polar Coded System for the Two-User Multiple-Access Channel

This paper presents non-binary polar codes for the two-user multiple-acc...
research
06/05/2023

Low-Latency SCL Bit-Flipping Decoding of Polar Codes

Bit flipping can be used as a postprocessing technique to further improv...
research
03/19/2021

Bhattacharyya parameter of monomials codes for the Binary Erasure Channel: from pointwise to average reliability

Monomial codes were recently equipped with partial order relations, fact...
research
02/08/2021

Design of Polar Code Lattices of Small Dimension

Polar code lattices are formed from binary polar codes using Constructio...
research
05/11/2021

Using Deep Neural Networks to Predict and Improve the Performance of Polar Codes

Polar codes can theoretically achieve very competitive Frame Error Rates...
research
04/15/2020

On Cyclic Polar Codes and The Burst Erasure Performance of Spatially-Coupled LDPC Codes

Polar codes were introduced in 2009 and proven to achieve the symmetric ...

Please sign up or login with your details

Forgot password? Click here to reset