English
Related papers

Related papers: Symbol-Decision Successive Cancellation List Decod…

200 papers

Polar codes are newly discovered capacity-achieving codes, which have attracted lots of research efforts. Polar codes can be efficiently decoded by the low-complexity successive cancelation (SC) algorithm and the SC list (SCL) decoding…

Information Theory · Computer Science 2016-11-17 Jun Lin , Chenrong Xiong , Zhiyuan Yan

Polar codes with memory (PCM) are proposed in this paper: a pair of consecutive code blocks containing a controlled number of mutual information bits. The shared mutual information bits of the succeeded block can help the failed block to…

Information Theory · Computer Science 2019-07-02 Wenyue Zhou , Qiang Liu , Yifei Shen , Xiaofeng Zhou , Chuan Zhang , Yaohua Xu , Liping Li

The recently proposed Successive-Cancellation List Flip (SCLF) decoding algorithm for polar codes improves the error-correcting performance of state-of-the-art SC List (SCL) decoding. However, it comes at the cost of a higher complexity. In…

Information Theory · Computer Science 2024-09-04 Charles Pillet , Ilshat Sagitov , Grégoire Domer , Pascal Giard

Polar codes are a class of linear error correction codes which provably attain channel capacity with infinite codeword lengths. Finite length polar codes have been adopted into the 5th Generation 3GPP standard for New Radio, though their…

Information Theory · Computer Science 2019-02-07 Adam Cavatassi , Thibaud Tonnellier , Warren J. Gross

The successive cancellation list decoder (SCL) is an efficient decoder for classical polar codes with low decoding error, approximating the maximum likelihood decoder (MLD) for small list sizes. Here we adapt the SCL to the task of decoding…

Quantum Physics · Physics 2026-05-14 Anqi Gong , Joseph M. Renes

Due to the sequential nature of the successive-cancellation (SC) algorithm, the decoding of polar codes suffers from significant decoding latencies. Fast SC decoding is able to speed up the SC decoding process, by implementing parallel…

Information Theory · Computer Science 2022-11-21 Yang Lu , Ming-Min Zhao , Ming Lei , Min-Jian Zhao

In successive cancellation (SC) polar decoding, an incorrect estimate of any prior unfrozen bit may bring about severe error propagation in the following decoding, thus it is desirable to find out and correct an error as early as possible.…

Information Theory · Computer Science 2017-12-12 Zhaoyang Zhang , Kangjian Qin , Liang Zhang , Huazi Zhang , Guo Tai Chen

Polar codes are widely considered as one of the most exciting recent discoveries in channel coding. For short to moderate block lengths, their error-correction performance under list decoding can outperform that of other modern…

Signal Processing · Electrical Eng. & Systems 2018-06-06 Pascal Giard , Andreas Burg

Bit flipping can be used as a postprocessing technique to further improve the performance for successive cancellation list (SCL) decoding of polar codes. However, the number of bit-flipping trials could increase the decoding latency…

Information Theory · Computer Science 2023-06-06 Wei Zhang , Xiaofu Wu

This paper presents a hardware architecture of fast simplified successive cancellation (fast-SSC) algorithm for polar codes, which significantly reduces the decoding latency and dramatically increases the throughput. Algorithmically,…

Information Theory · Computer Science 2015-09-30 Tiben Che , Jingwei Xu , Gwan Choi

A heuristic construction of polar codes for successive cancellation list (SCL) decoding with a given list size is proposed to balance the trade-off between performance measured in frame error rate (FER) and decoding complexity. Furthermore,…

Information Theory · Computer Science 2018-08-03 Peihong Yuan , Tobias Prinz , Georg Böcherer , Onurcan İşcan , Ronald Böhnke , Wen Xu

Node-based successive cancellation list (SCL) decoding has received considerable attention in wireless communications for its significant reduction in decoding latency, particularly with 5G New Radio (NR) polar codes. However, the existing…

Hardware Architecture · Computer Science 2024-08-09 Yuqing Ren , Leyu Zhang , Ludovic Damien Blanc , Yifei Shen , Xinwei Li , Alexios Balatsoukas-Stimming , Chuan Zhang , Andreas Burg

The recently-discovered polar codes are widely seen as a major breakthrough in coding theory. These codes achieve the capacity of many important channels under successive cancellation decoding. Motivated by the rapid progress in the theory…

Hardware Architecture · Computer Science 2015-03-17 Camille Leroux , Ido Tal , Alexander Vardy , Warren J. Gross

Polar codes are the first error-correcting code proven to achieve channel capacity based on infinite code length. The Successive Cancellation List Flip (SCLF) decoding algorithm was proposed by flipping an erroneous bit during the next…

Signal Processing · Electrical Eng. & Systems 2026-05-25 Fu-Siang Liang , Shan Lu , Yeong-Luh Ueng

Polar codes are able to achieve the capacity of memoryless channels under successive cancellation (SC) decoding. Soft Cancellation (SCAN) is a soft-output decoder based on the SC schedule, useful in iterative decoding and concatenation of…

Information Theory · Computer Science 2020-04-09 Charles Pillet , Carlo Condo , Valerio Bioglio

Research on polar codes has been constantly gaining attention over the last decade, by academia and industry alike, thanks to their capacity-achieving error-correction performance and low-complexity decoding algorithms. Recently, they have…

Information Theory · Computer Science 2020-06-25 Carlo Condo , Valerio Bioglio , Ingmar Land

Non-binary linear block codes (NB-LBCs) are an important class of error-correcting codes that are especially competent in correcting burst errors. They have broad applications in modern communications and storage systems. However, efficient…

Information Theory · Computer Science 2026-01-21 Jingyu Lin , Li Chen , Xiaoqian Ye

Polar codes under cyclic redundancy check aided successive cancellation list (CA-SCL) decoding can outperform the turbo codes and the LDPC codes when code lengths are configured to be several kilobits. In order to reduce the decoding…

Information Theory · Computer Science 2015-08-11 Kai Chen , Bin Li , Hui Shen , Jie Jin , David Tse

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

Successive cancellation (SC) is the first and widely known decoder of polar codes, which has received a lot of attentions recently. However, its decoding schedule generating algorithms are still primitive, which are not only complex but…

Information Theory · Computer Science 2015-05-15 Dan Le , Xiamu Niu