Complexity-Adaptive Maximum-Likelihood Decoding of Modified G_N-Coset Codes

by   Peihong Yuan, et al.

A complexity-adaptive tree search algorithm is proposed for G_N-coset codes that implements maximum-likelihood (ML) decoding by using a successive decoding schedule. The average complexity is close to that of the successive cancellation (SC) decoding for practical error rates when applied to polar codes and short Reed-Muller (RM) codes, e.g., block lengths up to N=128. By modifying the algorithm to limit the worst-case complexity, one obtains a near-ML decoder for longer RM codes and their subcodes. Unlike other bit-flip decoders, no outer code is needed to terminate decoding. The algorithm can thus be applied to modified G_N-coset code constructions with dynamic frozen bits. One advantage over sequential decoders is that there is no need to optimize a separate parameter.



There are no comments yet.


page 1

page 2

page 3

page 4


Successive Cancellation Ordered Search Decoding of Modified _N-Coset Codes

A tree search algorithm called successive cancellation ordered search (S...

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

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

A Tree Search Approach for Maximum-Likelihood Decoding of Reed-Muller Codes

A low-complexity tree search approach is presented that achieves the max...

Orthogonal Sparse Superposition Codes

This paper presents a new class of sparse superposition codes for effici...

Approaching the Finite Blocklength Capacity within 0.025dB by Short Polar Codes and CRC-Aided Hybrid Decoding

In this letter, we explore the performance limits of short polar codes a...

Polar Coding with Chemical Reaction Networks

In this paper, we propose a new polar coding scheme with molecular progr...

Bounds on the Error Probability of Raptor Codes under Maximum Likelihood Decoding

In this paper upper bounds on the probability of decoding failure under ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.