English
Related papers

Related papers: Low-Latency SC Decoder Architectures for Polar Cod…

200 papers

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

It's known that the bit errors of polar codes with successive cancellation (SC) decoding are coupled. We call the coupled information bits the correlated bits. In this paper, concatenation schemes are studied for polar codes (as inner…

Information Theory · Computer Science 2016-03-22 Ya Meng , Liping Li , Yanjun Hu

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

We present a method of constructing rate-compatible polar codes that are capacity-achieving with low-complexity sequential decoders. The proposed code construction allows for incremental retransmissions at different rates in order to adapt…

Information Theory · Computer Science 2016-01-29 Song-Nam Hong , Dennis Hui , Ivana Marić

Product codes are widespread in optical communications, thanks to their high throughput and good error-correction performance. Systematic polar codes have been recently considered as component codes for product codes. In this paper, we…

Information Theory · Computer Science 2019-01-23 Valerio Bioglio , Carlo Condo , Ingmar Land

Although the successive cancelation (SC) algorithm works well for very long polar codes, its error performance for shorter polar codes is much worse. Several SC based list decoding algorithms have been proposed to improve the error…

Information Theory · Computer Science 2015-06-22 Jun Lin , Zhiyuan Yan

In this paper, we present a novel decoding algorithm of a polar code, named SC-Fano decoding, by appropriately incorporating the Fano sequential decoding into the standard successive-cancellation (SC) decoding. The proposed SC-Fano decoding…

Signal Processing · Electrical Eng. & Systems 2019-01-24 Min-Oh Jeong , Song-Nam Hong

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

Polar codes are a recently proposed class of block codes that provably achieve the capacity of various communication channels. They received a lot of attention as they can do so with low-complexity encoding and decoding algorithms, and they…

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

Successive cancellation list decoders with flip operations (SCL-Flip) can utilize re-decoding attempts to significantly improve the error-correction performance of polar codes. However, these re-decoding attempts result in extra computation…

Information Theory · Computer Science 2021-12-10 Yansong Lv , Hang Yin , Zhanxin Yang , Yuhuan Wang , Jingxin Dai , Jing Huan

Typically, forward error correction (FEC) codes are designed based on the minimization of the error rate for a given code rate. However, for applications that incorporate hybrid automatic repeat request (HARQ) protocol and adaptive…

Information Theory · Computer Science 2018-11-07 Hossein Khoshnevis , Ian Marsland , Halim Yanikomeroglu

In this paper, we propose a decision-aided scheme for parallel SC-List decoding of polar codes. At the parallel SC-List decoder, each survival path is extended based on multiple information bits, therefore the number of split paths becomes…

Information Theory · Computer Science 2015-06-10 Bin Li , Hui Shen , Kai Chen

Polar codes attract more and more attention of researchers in recent years, since its capacity achieving property. However, their error-correction performance under successive cancellation (SC) decoding is inferior to other modern channel…

Signal Processing · Electrical Eng. & Systems 2019-03-11 Yu Wang , Lirui Chen , Qinglin Wang , Yang Zhang , Zuocheng Xing

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

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

In theory, Polar codes do not exhibit an error floor under successive-cancellation (SC) decoding. In practice, frame error rate (FER) down to $10^{-12}$ has not been reported with a real SC list (SCL) decoder hardware. This paper presents…

Information Theory · Computer Science 2019-04-05 Jiajie Tong , Huazi Zhang , Lingchen Huang , Xiaocheng Liu , Jun Wang

Previous work showed that polar codes can be decoded using off-the-shelf LDPC decoders by imposing special constraints on the LDPC code structure, which, however, resulted in some performance degradation. In this paper we show that this…

Information Theory · Computer Science 2019-09-27 Moustafa Ebada , Ahmed Elkelesh , Stephan ten Brink

In this work, we present a simplified successive cancellation list decoder that uses a Chase-like decoding process to achieve a six time improvement in speed compared to successive cancellation list decoding while maintaining the same…

Information Theory · Computer Science 2015-12-25 Gabi Sarkis , Pascal Giard , Alexander Vardy , Claude Thibeault , Warren J. Gross

A modified successive cancellation list (SCL) decoder is proposed for polar-coded probabilistic shaping. The decoder exploits the deterministic encoding rule for shaping bits to rule out candidate code words that the encoder would not…

Information Theory · Computer Science 2023-10-25 Constantin Runge , Thomas Wiegart , Diego Lentner