.png){kind=icon}
.png){kind=icon}
Return
Dynamic Frozen-Function Design for Reed-Muller Codes With Automorphism-Based Decoding
.png){kind=icon}
OA
AI
DOI：10.1109/LCOMM.2022.3230202.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, we propose to add dynamic frozen bits to underlying polar codes with a Reed-Muller information set with the aim of maintaining the same sub-decoding structure in Automorphism Ensemble (AE) and lowering the Maximum Likelihood (ML) bound by reducing the number of minimum weight codewords. We provide the dynamic freezing constraint matrix that remains identical after applying a permutation linear transformation. This feature also permits to drastically reduce the memory requirements of an AE decoder with polar-like codes having dynamic frozen bits. We show that, under AE decoding, the proposed dynamic freezing constraints lead to a gain of up to 0.25 dB compared to the ML bound of the R(3, 7) Reed-Muller code, at the cost of small increase in memory requirements.
Keywords:
Codes
Polar codes
Vehicle dynamics
Reed-Muller codes
Maximum likelihood decoding
Memory management
Reliability
polar codes
decoding
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W