Sublinear Latency for Simplified Successive Cancellation Decoding of Polar Codes
share
In this work we analyze the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. We show that, unlike conventional successive cancellation decoding, whose latency is linear in the block length, the latency of SSC decoding is sublinear. More specifically, we show that the latency of SSC decoding is O(N^1-1/μ), where N is the block length and μ is the scaling exponent of the transmission channel, which captures the speed at which the rate tends to capacity. We also provide numerical results demonstrating the tightness of the bound and the fact that asymptotically most of the savings in latency comes from the parallel decoding of the constituent codes comprising the polar code.
READ FULL TEXT