A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes
[article]

2020
*
arXiv
*
pre-print

This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements P that can perform SSC decoding operations in parallel is limited, as is the case in practice, the latency of SSC decoding is O(N^1-1/μ+N/Plog_2log_2N/P), where N is the block length of the code and μ is the scaling exponent of the channel. Three direct consequences of this bound are

arXiv:2012.13378v1
fatcat:v2ty5glqenfpfgdz7icpogsdtm