Automorphism Ensemble Decoding of Reed–Muller Codes
Top Cited Papers
- 21 July 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 69 (10) , 6424-6438
Abstract
Reed—Muller (RM) codes are known for their good maximum likelihood (ML) performance in the short block-length regime. Despite being one of the oldest classes of channel codes, finding a low complexity soft-input decoding scheme is still an open problem. In this work, we present a versatile decoding architecture for RM codes based on their rich automorphism group. The decoding algorithm can be seen as a generalization of multiple-bases belief propagation (MBBP) and may use any polar or RM decoder as constituent decoders. We provide extensive error-rate performance simulations for successive cancellation (SC)-, SC-list (SCL)-and belief propagation (BP)-based constituent decoders.We furthermore compare our results to existing decoding schemes and report a near-ML performance for the RM(3,7)-code (e.g., 0.04 dB away from the ML bound at BLER of 10–3) at a competitive computational cost. Moreover, we provide some insights into the automorphism subgroups of RM codes and SC decoding and, thereby, prove the theoretical limitations of this method with respect to polar codes.Keywords
All Related Versions
This publication has 30 references indexed in Scilit:
- Algebraic properties of polar codes from a new polynomial formalism2016
- Fast List Decoders for Polar CodesIEEE Journal on Selected Areas in Communications, 2015
- Reed–Muller Codes for Random Erasures and ErrorsIEEE Transactions on Information Theory, 2015
- List Decoding of Polar CodesIEEE Transactions on Information Theory, 2015
- From Polar to Reed-Muller Codes: A Technique to Improve the Finite-Length PerformanceIEEE Transactions on Communications, 2014
- Low-Complexity Soft-Output Decoding of Polar CodesIEEE Journal on Selected Areas in Communications, 2014
- The Box-Minus Operator and its Application to Low-Complexity Belief Propagation Decoding2005
- Codes on graphs: normal realizationsIEEE Transactions on Information Theory, 2001
- Hard- and soft-decision decoding beyond the half minimum distance---An algorithm for linear codes (Corresp.)IEEE Transactions on Information Theory, 1986
- Binary codes with specified minimum distanceIEEE Transactions on Information Theory, 1960