Technical Program

Paper Detail

Paper Title Convolutional Decoding of Polar Codes
Paper IdentifierWE1.R1.1
Authors Arman Fazeli, Alexander Vardy, Hanwen Yao, University of California, San Diego, United States
Session Polar Codes I
Location Le Théatre (Parterre), Level -1
Session Time Wednesday, 10 July, 09:50 - 11:10
Presentation Time Wednesday, 10 July, 09:50 - 10:10
Manuscript  Click here to download the manuscript
Abstract In this paper, we present polar codes that are concatenated with an underlying high-rate convolutional code, which are shown to have superior performances over the state of the art. We also present a computationally-efficient decoding algorithm for these codes, which resembles the techniques used in the Viterbi algorithm, and hence is called convolutional decoding algorithm. We address some shortcomings of the CRC-aided list decoder and discuss how to turn around them by emulating a convolutional code instead of a CRC code. Contrary to CRC codes, most of the convolutional codes are not a proper choice for concatenation with polar codes. We introduce the bucketing algorithm to construct suitable punctured convolutional codes for this purpose. The proposed framework can accommodate any such underlying convolutional code, which allows one to search for the optimal convolutional code based on their design parameters.