Backtracking and Look-Ahead Decoding Algorithms for Improved Successive Cancellation Decoding Performance of Polar Codes

Vajha, M and Mukka, VSC and Kumar, PV (2019) Backtracking and Look-Ahead Decoding Algorithms for Improved Successive Cancellation Decoding Performance of Polar Codes. In: 2019 IEEE International Symposium on Information Theory, ISIT 2019, 7 July 2019-12 July 2019, Paris, pp. 31-35.

PDF ISIT_2019.pdf - Published Version Restricted to Registered users only Download (12MB) | Request a copy

Abstract

In 1, Arikan introduced polar codes and proved that they are capacity achieving over symmetric binary memoryless channels under successive cancellation decoding (SCD). However, the metric used in the SCD algorithm does not incorporate knowledge of future frozen bits. In this paper we take a fresh look at the SCD algorithm and propose two decoding algorithms a) successive cancellation with back-tracking (SC-BT) and successive cancellation with look ahead (SC-LA). Both algorithms try to improve the performance using a memory of size O(N). We also extend the SC-LA algorithm to work with successive cancellation list decoding (SCLD). © 2019 IEEE.

Item Type:	Conference Paper
Publication:	IEEE International Symposium on Information Theory - Proceedings
Publisher:	Institute of Electrical and Electronics Engineers Inc.
Additional Information:	The copyright for this article belongs to Institute of Electrical and Electronics Engineers Inc.
Keywords:	Information theory, Back tracking; Decoding algorithm; Frozen bits; List decoding; Memoryless channels; Polar codes; Successive cancellation; Successive-cancellation decoding, Decoding
Department/Centre:	Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited:	19 Dec 2022 07:12
Last Modified:	19 Dec 2022 07:12
URI:	https://eprints.iisc.ac.in/id/eprint/78503

Actions (login required)

View Item