English
Related papers

Related papers: Overlapped List Successive Cancellation Approach f…

200 papers

Polar codes are a class of error-correcting codes that provably achieve the capacity of practical channels. The successive-cancellation flip (SCF) decoder is a low-complexity decoder that was proposed to improve the performance of the…

Information Theory · Computer Science 2023-08-07 Ilshat Sagitov , Charles Pillet , Alexios Balatsoukas-Stimming , Pascal Giard

To extend the applications of polar codes within next-generation wireless communication systems, it is essential to incorporate support for Incremental Redundancy (IR) Hybrid Automatic Repeat Request (HARQ) schemes. The baseline IR-HARQ…

Signal Processing · Electrical Eng. & Systems 2025-10-03 Marwan Jalaleddine , Jiajie Li , Warren J. Gross

In this paper, we first indicate that the block error event of polar codes under successive cancellation list (SCL) decoding is composed of path loss (PL) error event and path selection (PS) error event, where the PL error event is that…

Information Theory · Computer Science 2023-07-07 Jinnan Piao , Dong Li , Xueting Yu , Zhibo Li , Ming Yang , Jindi Liu , Peng Zeng

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 provably achieve the symmetric capacity of a memoryless channel while having an explicit construction. This work aims to increase the throughput of polar decoder hardware by an order of magnitude relative to the state of the art…

Hardware Architecture · Computer Science 2015-05-20 Gabi Sarkis , Pascal Giard , Alexander Vardy , Claude Thibeault , Warren J. Gross

In the conventional successive cancellation (SC) decoder for polar codes, all the future bits to be estimated later are treated as random variables. However, polar codes inevitably involve frozen bits, and their concatenated coding schemes…

Information Theory · Computer Science 2023-09-19 Min Jang , Jong-Hwan Kim , Seho Myung , Kyeongcheol Yang

Polar codes provably achieve the capacity of a wide array of channels under successive decoding. This assumes infinite precision arithmetic. Given the successive nature of the decoding algorithm, one might worry about the sensitivity of the…

Information Theory · Computer Science 2012-09-21 S. Hamed Hassani , Rudiger Urbanke

The performance of short polar codes under successive cancellation (SC) and SC list (SCL) decoding is analyzed for the case where the decoder messages are coarsely quantized. This setting is of particular interest for applications requiring…

Information Theory · Computer Science 2020-09-14 Joachim Neu , Mustafa Cemil Coşkun , Gianluigi Liva

In this paper, we design and compare multilevel polar coding (MLPC) and bit-interleaved polar coded modulation (BIPCM) for uplink sparse code multiple access (SCMA) systems that operate over fast and block fading channels. Both successive…

Information Theory · Computer Science 2017-07-05 Monirosharieh Vameghestahbanati , Ian Marsland , Ramy H. Gohary , Halim Yanikomeroglu

In this work, we present hardware and software implementations of flexible polar systematic encoders and decoders. The proposed implementations operate on polar codes of any length less than a maximum and of any rate. We describe the…

Information Theory · Computer Science 2016-08-29 Gabi Sarkis , Ido Tal , Pascal Giard , Alexander Vardy , Claude Thibeault , Warren J. Gross

Benefiting from performance advantages under short code lengths, polar codes are well-suited for certain scenarios, such as the future Internet of Things (IoT) applications that require high reliability and low power. Existing list flip…

Information Theory · Computer Science 2025-04-01 Yansong Lv , Jingxin Dai , Yuhuan Wang , Hang Yin , Zhanxin Yang

This paper first presents a new approach to evaluating the descriptive complexity of finite-length binary sequences. Specifically, we investigate the sequence-wise recovery behavior induced by polar compression and successive cancellation…

Information Theory · Computer Science 2026-05-15 Xinyuanmeng Yao , Xiao Ma

Polar codes are the first provable capacity-achieving forward error correction (FEC) codes. In general polar codes can be decoded via either successive cancellation (SC) or belief propagation (BP) decoding algorithm. However, to date…

Information Theory · Computer Science 2014-11-27 Bo Yuan , Keshab K. Parhi

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

We exploit the redundancy of the language-based source to help polar decoding. By judging the validity of decoded words in the decoded sequence with the help of a dictionary, the polar list decoder constantly detects erroneous paths after…

Information Theory · Computer Science 2020-07-24 Ying Wang , Minghai Qin , Krishna R. Narayanan , Anxiao Jiang , Zvonimir Bandic

As a new joint source-channel coding scheme, the double polar (D-Polar) codes have been proposed recently. In this letter, a novel joint source-channel decoder, namely the joint successive cancellation list (J-SCL) decoder, is proposed to…

Information Theory · Computer Science 2022-01-11 Yanfei Dong , Kai Niu , Jincheng Dai , Sen Wang , Yifei Yuan

In this paper, we introduce a novel class of pre-transformed polar codes, termed as deep polar codes. We first present a deep polar encoder that harnesses a series of multi-layered polar transformations with varying sizes. Our approach to…

Information Theory · Computer Science 2023-08-08 Geon Choi , Namyoon Lee

Sorting operation is one of the main bottlenecks for the successive-cancellation list (SCL) decoding. This paper introduces an improvement to the SCL decoding for polar and pre-transformed polar codes that reduces the number of sorting…

Information Theory · Computer Science 2022-07-26 Mohsen Moradi , Amir Mozammel

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

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