Recursive/Iterative unique Projection-Aggregation of RM codes

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 the baseline RPA algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/01/2020

Hardware Implementation of Iterative Projection-Aggregation Decoding of Reed-Muller Codes

In this work, we present a simplification and a corresponding hardware a...
research
12/27/2017

Guarded and Unguarded Iteration for Generalized Processes

Models of iterated computation, such as (completely) iterative monads, o...
research
08/29/2022

Multi-Factor Pruning for Recursive Projection-Aggregation Decoding of RM Codes

The recently introduced recursive projection aggregation (RPA) decoding ...
research
10/20/2022

Hardware Implementation of Iterative Projection Aggregation Decoding for Reed-Muller Codes

The recently proposed recursive projection-aggregation (RPA) decoding al...
research
01/16/2023

Machine Learning-Aided Efficient Decoding of Reed-Muller Subcodes

Reed-Muller (RM) codes achieve the capacity of general binary-input memo...
research
02/02/2021

Reed-Muller Subcodes: Machine Learning-Aided Design of Efficient Soft Recursive Decoding

Reed-Muller (RM) codes are conjectured to achieve the capacity of any bi...
research
11/25/2020

Sparse Multi-Decoder Recursive Projection Aggregation for Reed-Muller Codes

Reed-Muller (RM) codes are one of the oldest families of codes. Recently...

Please sign up or login with your details

Forgot password? Click here to reset