Decoding Reed-Muller Codes Using Redundant Code Constraints
Paper i 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.

Författare

Mengke Lian

Duke University

Christian Häger

Chalmers, Elektroteknik, Kommunikations- och antennsystem, Kommunikationssystem

Henry D. Pfister

Duke University

IEEE International Symposium on Information Theory - Proceedings

21578095 (ISSN)

42-47 9174087

2020 IEEE International Symposium on Information Theory, ISIT 2020
Los Angeles, CA, USA,

Coding for terabit-per-second fiber-optical communications (TERA)

Europeiska kommissionen (EU), 2017-01-01 -- 2019-12-31.

Styrkeområden

Informations- och kommunikationsteknik

Ämneskategorier

Kommunikationssystem

DOI

10.1109/ISIT44484.2020.9174087

Mer information

Senast uppdaterat

2020-09-22