Polar codes with large kernels achieve optimal error exponents but are difficult to construct when low decoding complexity is also required. We address this challenge under recursive maximum likelihood decoding (RMLD) using a reinforcement learning approach based on the Gumbel AlphaZero algorithm. The resulting method, PolarZero, consistently matches exhaustive search in identifying low-complexity kernels, and discovers a size-16 kernel with complexity comparable to handcrafted designs. Our results suggest that PolarZero is a scalable tool for large-kernel design, where brute-force search is no longer feasible.
Reinforcement Learning-Aided Design of Efficient Polarization Kernels
Stefano Rini;Luca Barletta
2025-01-01
Abstract
Polar codes with large kernels achieve optimal error exponents but are difficult to construct when low decoding complexity is also required. We address this challenge under recursive maximum likelihood decoding (RMLD) using a reinforcement learning approach based on the Gumbel AlphaZero algorithm. The resulting method, PolarZero, consistently matches exhaustive search in identifying low-complexity kernels, and discovers a size-16 kernel with complexity comparable to handcrafted designs. Our results suggest that PolarZero is a scalable tool for large-kernel design, where brute-force search is no longer feasible.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
2505.04127v2.pdf
accesso aperto
:
Post-Print (DRAFT o Author’s Accepted Manuscript-AAM)
Dimensione
188.75 kB
Formato
Adobe PDF
|
188.75 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.


