.png){kind=icon}
Return
Sequential Automorphism Ensemble Decoding With Early Stopping
.png){kind=icon}
PRE
AI
DOI：10.1109/lcomm.2026.3727412.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, a low-complexity approach for the automorphism ensemble decoder (AED) using successive cancellation (SC) as constituent decoders is proposed. The approach sequentially activates sub-decoders and terminates the decoding process based on pre-optimized parameters, derived from the strong correlation observed between the decoding outcome and the SC path metric. An algorithm is proposed to find a list of early termination thresholds that minimize average decoding complexity subject to a block-error rate (BLER) constraint. For various code parameters and a BLER below $10^{-3}$ , simulation results show that average decoding complexity is reduced by a factor of at least $6\times $ , and up to $22\times $ , compared to the original AED complexity, with a negligible degradation in BLER.
Keywords:
Polar codes
Reed-Muller codes
automorphism ensemble decoding
decoding complexity
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.2W
Organization
Cited Papers
No cited papers available