In this paper, we analyze the decoding complexity of polarizing kernels of size larger than p = 2, proposing a general procedure which can be used to marginalize kernels of any size. We use this method to evaluate the decoding equations for optimal binary kernels up to size p = 8. Finally, we experimentally show that, even if T 2 and T 8 share the same polarization exponent, their performance may vary under list decoding, making large kernels of interest for long polar codes.
On the Marginalization of Polarizing Kernels
Bioglio V
First
;
2018-01-01
Abstract
In this paper, we analyze the decoding complexity of polarizing kernels of size larger than p = 2, proposing a general procedure which can be used to marginalize kernels of any size. We use this method to evaluate the decoding equations for optimal binary kernels up to size p = 8. Finally, we experimentally show that, even if T 2 and T 8 share the same polarization exponent, their performance may vary under list decoding, making large kernels of interest for long polar codes.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
2018-on_the_marginalization_of_polarizing_kernels.pdf
Accesso riservato
Dimensione
218.71 kB
Formato
Adobe PDF
|
218.71 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
