.png){kind=icon}
.png){kind=icon}
Return
A fast parallel SC-Fano decoding algorithm for PAC codes
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-022-3498-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In order to effectively reduce the decoding latency of successive cancellation decoding aided Fano (SC-Fano) decoder employed in polarization-adjusted convolutional (PAC) codes, a fast parallel SC-Fano decoding algorithm is designed, which leverages multiple individual decoding components. Critical challenges arise from how to appropriately initialize the thresholds of different SC-Fano decoding components and how will these decoding components cooperate with each other. After appropriately overcoming these challenges, our design is capable of halving the decoding latency without incurring any noticeable frame error rate (FER) performance degradation, meanwhile, the overall computational complexity is normally constrained below one and a half times of that required by conventional SC-Fano decoders in simulated typical configurations.
Keywords:
PAC codes
parallel decoding
Fano decoding
complexity
Journal
IF:
7.6
Papers:
4.9K
Citations:
8.9K