In terms of overall latency, one of the main bottlenecks of successive cancellation list (SCL) decoding of polar codes is the path pruning unit (PPU), whose goal is to prune 2L paths to L paths. To remedy this shortcoming, we propose a two-step metric sorter adapted to a parallel implementation of SCL decoding. We describe our sorter architecture and we show that our proposed solution outperforms the state-of-the-art PPUs in terms of area and latency reduction.
Two-Step Metric Sorting for Parallel Successive Cancellation List Decoding of Polar Codes
Bioglio V
First
;
2017-01-01
Abstract
In terms of overall latency, one of the main bottlenecks of successive cancellation list (SCL) decoding of polar codes is the path pruning unit (PPU), whose goal is to prune 2L paths to L paths. To remedy this shortcoming, we propose a two-step metric sorter adapted to a parallel implementation of SCL decoding. We describe our sorter architecture and we show that our proposed solution outperforms the state-of-the-art PPUs in terms of area and latency reduction.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
2017-two-step-metric-sorting-for-parallel-successive-cancellation-list-decoding-of-polar-codes.pdf
Accesso riservato
Dimensione
561.43 kB
Formato
Adobe PDF
|
561.43 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.
