An Area-Efficient Routing Solution for Automorphism Ensemble Decoding of Polar Codes
IEEE Transactions on Communications · 2026 · 74 · 6843-6858
DOI: 10.1109/tcomm.2026.3679241 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Communications, 2026. Verfasst von Jiajie Li und 4 weiteren Autor:innen. Die Arbeit nennt 44 Literaturangaben.
Abstract (Originalsprache)
Implementing automorphisms requires hardware for routing, and it leads to a large area overhead, especially when the number of automorphisms is large. We propose methods for selecting automorphisms in successive cancellation (AED-SC) decoders to reduce the number of routes. We established the equivalence between the automorphism selection and the NP-hard minimum $K$ -union (MKU) problem. To maintain decoding performance under the selected automorphisms, the equivalent class property of the AED-SC is formulated as a quadratic constraint. Also, by incorporating the Hamming distance-based selection method, the problem size of the MKU problem with the quadratic constraint is reduced while enhancing decoding performance. Two heuristics are proposed: a sequential algorithm based on the least expanding set problem, and a greedy algorithm with a complexity that grows linearly with the problem size. Up to a 65% reduction in the number of routes is returned by proposed methods when compared to the state-of-the-art result, while the returned automorphism sets yield comparable decoding performance to the randomly selected set. Synthesis is performed for the routing unit for polar codes with a code length $n=128$ , a dimension $k=60$ , and 63 automorphisms that require routing, and these synthesis results verify that a 59% reduction in the number of routes reduces 57% of the logic area required by the routes, which leads to an overall area reduction of 25%.
Zitieren
APA
Li, J., Zhou, H., Seah, R., Jalaleddine, M., & Gross, W. J. (2026). An Area-Efficient Routing Solution for Automorphism Ensemble Decoding of Polar Codes. IEEE Transactions on Communications, 74, 6843-6858. https://doi.org/10.1109/tcomm.2026.3679241
Vancouver
Li J, Zhou H, Seah R, Jalaleddine M, Gross WJ. An Area-Efficient Routing Solution for Automorphism Ensemble Decoding of Polar Codes. IEEE Transactions on Communications. 2026;74:6843-6858. doi:10.1109/tcomm.2026.3679241
BibTeX
@article{Li2026,
author = {Li, Jiajie and Zhou, Huayi and Seah, Ryan and Jalaleddine, Marwan and Gross, Warren J.},
title = {An Area-Efficient Routing Solution for Automorphism Ensemble Decoding of Polar Codes},
journal = {IEEE Transactions on Communications},
year = {2026},
volume = {74},
pages = {6843--6858},
doi = {10.1109/tcomm.2026.3679241}
}
EUVIMED