Decoding Reed-Muller Codes Using Redundant Code Constraints
Paper in proceeding, 2020
The recursive projection-aggregation (RPA) decoding algorithm for Reed-Muller (RM) codes was recently introduced by Ye and Abbe. We show that the RPA algorithm is closely related to (weighted) belief-propagation (BP) decoding by interpreting it as a message-passing algorithm on a factor graph with redundant code constraints. We use this observation to introduce a novel decoder tailored to high-rate RM codes. The new algorithm relies on puncturing rather than projections and is called recursive puncturing-aggregation (RXA). We also investigate collapsed (i.e., non-recursive) versions of RPA and RXA and show some examples where they achieve similar performance with lower decoding complexity.
Author
Mengke Lian
Duke University
Christian Häger
Chalmers, Electrical Engineering, Communication, Antennas and Optical Networks
Henry D. Pfister
Duke University
IEEE International Symposium on Information Theory - Proceedings
21578095 (ISSN)
Vol. 2020-June 42-47 91740879781728164328 (ISBN)
2020 IEEE International Symposium on Information Theory, ISIT 2020
Los Angeles, CA, USA,
Los Angeles, CA, USA,
Coding for terabit-per-second fiber-optical communications (TERA)
European Commission (EC) (EC/H2020/749798), 2017-01-01 -- 2019-12-31.
Areas of Advance
Information and Communication Technology
Subject Categories
Communication Systems
DOI
10.1109/ISIT44484.2020.9174087