Recursive/Iterative Unique Projection-Aggregation Decoding of Reed-Muller Codes
- 4 June 2023
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Abstract
We describe recursive unique projection-aggregation (RUPA) decoding and iterative unique projection-aggregation (IUPA) decoding of Reed-Muller (RM) codes, which remove non-unique projections from the recursive projection-aggregation (RPA) and iterative projection-aggregation (IPA) algorithms respectively. We show that these algorithms have competitive error-correcting performance while requiring up to 95% projections lower than the baseline RPA algorithm.Keywords
This publication has 11 references indexed in Scilit:
- Optimization and Simplification of PCPA Decoder for Reed-Muller CodesIEEE Communications Letters, 2022
- Reduced Complexity RPA Decoder for Reed-Muller Codes2021
- Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes2021
- Hardware Implementation of Iterative Projection-Aggregation Decoding of Reed-Muller Codes2021
- Decoding Reed–Muller Codes Using Redundant Code Constraints2020
- Recursive Projection-Aggregation Decoding of Reed-Muller CodesIEEE Transactions on Information Theory, 2020
- Efficient error-correcting codes in the short blocklength regimePhysical Communication, 2019
- Error Correction Coding2005
- Optimal soft decision block decoders based on fast Hadamard transformIEEE Transactions on Information Theory, 1986
- A class of multiple-error-correcting codes and the decoding schemeTransactions of the IRE Professional Group on Information Theory, 1954