English
Related papers

Related papers: Enabling Fast Polar SC Decoding with IR-HARQ

200 papers

In this paper, we introduce a new coding and decoding structure for enhancing the reliability and performance of polar codes, specifically at low error rates. We achieve this by concatenating two polar codes in series to create robust…

Information Theory · Computer Science 2023-11-07 Mohammed Mensouri , Mustapha Eddahibi

Successive cancellation list (SCL) decoders of polar codes excel in practical performance but pose challenges for theoretical analysis. Existing works either limit their scope to erasure channels or address general channels without taking…

Information Theory · Computer Science 2024-05-28 Hsin-Po Wang , Venkatesan Guruswami

This paper presents our low-latency Polar code encoders and decoders developed for the 2025 International Symposium on Topics in Coding (ISTC 2025) contest, which challenges participants to implement the fastest possible channel code…

Networking and Internet Architecture · Computer Science 2025-07-08 Mathieu Leonardon , Mohammed El Houcine Ayoubi , Adrien Cassagne , Romain Tajan , Camille Leroux

This paper presents a refined analysis of the block error rate (BLER) of polar codes over symmetric binary-input discrete memoryless channels under successive cancellation (SC) and successive cancellation list (SCL) decoding. A novel…

Information Theory · Computer Science 2026-03-23 Hassan Noghrei , Murad Abdullah

Polar codes are a new family of error correction codes for which efficient hardware architectures have to be defined for the encoder and the decoder. Polar codes are decoded using the successive cancellation decoding algorithm that includes…

Hardware Architecture · Computer Science 2015-01-12 Guillaume Berhault , Camille Leroux , Christophe Jego , Dominique Dallet

We show that the performance of iterative belief propagation (BP) decoding of polar codes can be enhanced by decoding over different carefully chosen factor graph realizations. With a genie-aided stopping condition, it can achieve the…

Information Theory · Computer Science 2018-04-09 Ahmed Elkelesh , Moustafa Ebada , Sebastian Cammerer , Stephan ten Brink

For finite length polar codes, channel polarization leaves a significant number of channels not fully polarized. Adding a Cyclic Redundancy Check (CRC) to better protect information on the semi-polarized channels has already been…

Information Theory · Computer Science 2016-11-14 A. Elkelesh , M. Ebada , S. Cammerer , S. ten Brink

This PhD thesis considers the performance evaluation and enhancement of video communication over wireless channels. The system model considers hybrid automatic repeat request (HARQ) with Chase combining and turbo product codes (TPC). The…

Information Theory · Computer Science 2017-06-12 Husameldin Mukhtar

The key to successive cancellation (SC) flip decoding of polar codes is to accurately identify the first error bit. The optimal flipping strategy is considered difficult due to lack of an analytical solution. Alternatively, we propose a…

Information Theory · Computer Science 2019-02-26 Xianbin Wang , Huazi Zhang , Rong Li , Lingchen Huang , Shengchen Dai , Yourui Huangfu , Jun Wang

Polar codes has been selected as the channel coding scheme for 5G new radio (NR) control channel. Specifically, a special type of parity-check polar (PC-Polar) codes was adopted in uplink control information (UCI). In this paper, we propose…

Information Theory · Computer Science 2020-07-03 Jiajie Tong , Huazi Zhang , Xianbin Wang , Shengchen Dai , Rong Li , Jun Wang

Successive-cancellation list (SCL) decoding of polar codes has been adopted for 5G. However, the performance is not very satisfactory with moderate code length. Heuristic or deep-learning-aided (DL-aided) flip algorithms have been developed…

Information Theory · Computer Science 2021-06-25 Yaoyu Tao , Zhengya Zhang

Successive-cancellation list (SCL) decoding is an algorithm that provides very good error-correction performance for polar codes. However, its hardware implementation requires a large amount of memory, mainly to store intermediate results.…

Hardware Architecture · Computer Science 2017-03-28 Seyyed Ali Hashemi , Alexios Balatsoukas-Stimming , Pascal Giard , Claude Thibeault , Warren J. Gross

We show that successive cancellation list decoding can be formulated exclusively using log-likelihood ratios. In addition to numerical stability, the log-likelihood ratio based formulation has useful properties which simplify the sorting…

Information Theory · Computer Science 2016-02-15 Alexios Balatsoukas-Stimming , Mani Bastani Parizi , Andreas Burg

Successive cancellation list (SCL) decoding enables polar codes and their generalizations to deliver satisfactory performance in finite-length scenarios but it comes with high latency and complexity. To reduce latency, a partitioned SCL…

Information Theory · Computer Science 2024-11-26 Xinyuanmeng Yao , Xiao Ma

An efficient implementation of min-sum SC/list decoding of convolutional polar codes is proposed. The complexity of the proposed implementation of SC decoding is more than two times smaller than the straightforward implementation. Moreover,…

Information Theory · Computer Science 2020-07-14 Ruslan Morozov

Although iterative decoding of polar codes has recently made huge progress based on the idea of permuted factor graphs, it still suffers from a non-negligible performance degradation when compared to state-of-the-art CRC-aided successive…

Information Theory · Computer Science 2020-01-20 Marvin Geiselhart , Ahmed Elkelesh , Moustafa Ebada , Sebastian Cammerer , Stephan ten Brink

A hybrid ARQ (HARQ) scheme for polar code, which is called active-bit relocation under masks (ARUM), is proposed. In each transmission, the data bits are encoded and bit-wisely XOR-masked using a binary vector before being transmitted…

Information Theory · Computer Science 2018-05-18 Kai Chen , Liangming Wu , Changlong Xu , Jian Li , Hao Xu , Jing Jiang

A polar-coded transmission (PCT) scheme with joint channel estimation and decoding is proposed for channels with unknown channel state information (CSI). The CSI is estimated via successive cancellation (SC) decoding and the constraints…

Information Theory · Computer Science 2021-02-23 Peihong Yuan , Mustafa Cemil Coşkun , Gerhard Kramer

Due to their capacity-achieving property, polar codes have become one of the most attractive channel codes. To date, the successive cancellation list (SCL) decoding algorithm is the primary approach that can guarantee outstanding…

Information Theory · Computer Science 2016-11-18 Bo Yuan , Keshab K. Parhi

In digital baseband processing, the forward error correction (FEC) unit belongs to the most demanding components in terms of computational complexity and power consumption. Hence, efficient implementation of FEC decoders is crucial for next…

Information Theory · Computer Science 2024-06-04 Claus Kestel , Lucas Johannsen , Norbert Wehn