DeepAI AI Chat
Log In Sign Up

Towards Optimal Decoding for Polar Codes

by   Min Jang, et al.

In the conventional successive cancellation (SC) decoder for polar codes, all the future bits to be estimated later are treated as random variables. However, polar codes inevitably involve frozen bits, and their concatenated coding schemes also include parity bits causally generated from the past bits estimated earlier. We refer to the frozen and parity bits located behind a target decoding bit as its future constraints (FCs). Although the values of FCs are deterministic given the past estimates, they have not been exploited in the conventional SC-based decoders, not leading to optimality. In this paper, we propose SC-check (SCC) and belief-propagation SCC (BP-SCC) decoding algorithms in order to leverage FCs in decoding.We further devise a tree search technique based on stack-based backjumping (SBJ) to solve dynamic constraint satisfaction problems (CSPs) formulated by FCs. Over the binary erasure channel (BEC), numerical results show that a combination of the BP-SCC algorithm and the SBJ tree search technique achieves the erasure recovery performance close to the dependence testing (DT) bound, a bound of achievable finite-length performance.


page 1

page 2

page 3

page 4


All the codeword bits in polar codes have the same BER under the SC decoder

We prove that for any binary-input memoryless symmetric (BMS) channel, a...

Efficient Decoding Algorithms for Polar Codes based on 2×2 Non-Binary Kernels

Polar codes based on 2×2 non-binary kernels are discussed in this work. ...

Successive Cancellation Inactivation Decoding for Modified Reed-Muller and eBCH Codes

A successive cancellation (SC) decoder with inactivations is proposed as...

Fast Successive-Cancellation Decoding of Polar Codes with Sequence Nodes

Due to the sequential nature of the successive-cancellation (SC) algorit...

A Soft Cancellation Decoder for Parity-Check Polar Codes

Polar codes has been selected as the channel coding scheme for 5G new ra...

Learning to Flip Successive Cancellation Decoding of Polar Codes with LSTM Networks

The key to successive cancellation (SC) flip decoding of polar codes is ...

Dynamic Frozen-Function Design for Reed-Muller Codes With Automorphism-Based Decoding

In this letter, we propose to add dynamic frozen bits to underlying pola...