Technical Program

Paper Detail

Paper IDC.6.3
Paper Title Simplified Successive Cancellation Decoding of Polar Codes Has Sublinear Latency
Authors Marco Mondelli, Institute of Science and Technology (IST) Austria, Austria; Seyyed Ali Hashemi, John Cioffi, Andrea Goldsmith, Stanford University, United States
Session C.6: Polar Codes I
Presentation Lecture
Track Coding for Communications
Manuscript  Click here to download the manuscript
Virtual Presentation  Click here to watch in the Virtual Symposium
Abstract This work analyzes the latency of the simplified successive cancellation (SSC) decoding scheme for polar codes proposed by Alamdar-Yazdi and Kschischang. It is shown that, unlike conventional successive cancellation decoding, where latency is linear in the block length, the latency of SSC decoding is sublinear. More specifically, the latency of SSC decoding is O(N^(1−1/µ)), where N is the block length and µ is the scaling exponent of the channel, which captures the speed of convergence of the rate to capacity. Numerical results demonstrate the tightness of the bound and show that most of the latency reduction arises from the parallel decoding of subcodes of rate 0 and 1.

Plan Ahead


2021 IEEE International Symposium on Information Theory

11-16 July 2021 | Melbourne, Victoria, Australia

Visit Website!