Fast list decoding of polar codes: Decoders for additional nodes

Abstract

This work focuses on fast successive-cancellation list decoding of polar codes. We propose list decoders for five newly-identified types of nodes in the decoding tree of a polar code. The proposed list decoders significantly improve the decoding speed by determining the best paths and calculating their corresponding path metrics without computing bit log-likelihood ratios.