DeepAI AI Chat
Log In Sign Up

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

by   Seyyed Ali Hashemi, et al.

A low-complexity tree search approach is presented that achieves the maximum-likelihood (ML) decoding performance of Reed-Muller (RM) codes. The proposed approach generates a bit-flipping tree that is traversed to find the ML decoding result by performing successive-cancellation decoding after each node visit. A depth-first search (DFS) and a breadth-first search (BFS) scheme are developed and a log-likelihood-ratio-based bit-flipping metric is utilized to avoid redundant node visits in the tree. Several enhancements to the proposed algorithm are presented to further reduce the number of node visits. Simulation results confirm that the BFS scheme provides a lower average number of node visits than the existing tree search approach to decode RM codes.


page 1

page 2

page 3

page 4


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

A complexity-adaptive tree search algorithm is proposed for G_N-coset co...

Anytime Decoding by Monte-Carlo Tree Search

An anytime decoding algorithm for tree codes using Monte-Carlo tree sear...

Optimal Upward Scaling of Minimum-TSC Binary Signature Sets

We consider upward scaling an overloaded min-TSC binary signature set an...

Successive Cancellation Ordered Search Decoding of Modified _N-Coset Codes

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

On Decoding of Reed-Muller Codes Using Local Graph Search

We present a novel iterative decoding algorithm for Reed-Muller (RM) cod...

Constrained Error Pattern Generation for GRAND

Maximum-likelihood (ML) decoding can be used to obtain the optimal perfo...

A Complexity Efficient DMT-Optimal Tree Pruning Based Sphere Decoding

We present a diversity multiplexing tradeoff (DMT) optimal tree pruning ...