English
Related papers

Related papers: Successive Cancellation Decoding For General Monot…

200 papers

Polar codes have attracted a lot of attention during past few years and have been adopted as a coding scheme for 5G standard. Successive-cancellation list (SCL) decoder provides high level error-correction performance for polar codes, but…

Information Theory · Computer Science 2019-04-25 Liang Ma , Hang Li , Yuejun Wei

A two-part successive syndrome-check decoding of polar codes is proposed with the first part successively refining the received codeword and the second part checking its syndrome. A new formulation of the successive-cancellation (SC)…

Information Theory · Computer Science 2021-12-02 Seyyed Ali Hashemi , Marco Mondelli , John Cioffi , Andrea Goldsmith

This paper focuses on low complexity successive cancellation list (SCL) decoding of polar codes. In particular, using the fact that splitting may be unnecessary when the reliability of decoding the unfrozen bit is sufficiently high, a novel…

Information Theory · Computer Science 2016-11-17 Zhaoyang Zhang , Liang Zhang , Xianbin Wang , Caijun Zhong , H. Vincent Poor

Polar codes are one of the most recent advancements in coding theory and they have attracted significant interest. While they are provably capacity achieving over various channels, they have seen limited practical applications.…

Information Theory · Computer Science 2016-11-17 Alexios Balatsoukas-Stimming , Georgios Karakonstantis , Andreas Burg

Multi-kernel polar codes have recently been proposed to construct polar codes of lengths different from powers of two. Decoder implementations for multi-kernel polar codes need to account for this feature, that becomes critical in memory…

Information Theory · Computer Science 2018-09-26 Valerio Bioglio , Carlo Condo , Ingmar Land

The decoding performance of polar codes strongly depends on the decoding algorithm used, while also the decoder throughput and its latency mainly depend on the decoding algorithm. In this work, we implement the powerful successive…

Information Theory · Computer Science 2016-12-22 Sebastian Cammerer , Benedikt Leible , Matthias Stahl , Jakob Hoydis , Stephan ten Brink

Long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. But for polar codes with short and moderate code length, the decoding…

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

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

Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern…

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

This paper proposes a high-throughput energy-efficient Successive Cancellation (SC) decoder architecture for polar codes based on combinational logic. The proposed combinational architecture operates at relatively low clock frequencies…

Hardware Architecture · Computer Science 2016-01-12 Onur Dizdar , Erdal Arıkan

Polar codes are linear block codes that can achieve channel capacity at infinite code length. Successive cancellation list (SCL) decoding relies on a set of parallel decoders; it yields good error-correction performance at finite code…

Information Theory · Computer Science 2021-01-12 Carlo Condo

Polar codes are a class of error-correcting codes that provably achieve the capacity of practical channels under the low-complexity successive-cancellation flip (SCF) decoding algorithm. However, the SCF decoding algorithm has a variable…

Information Theory · Computer Science 2024-09-06 Ilshat Sagitov , Charles Pillet , Pascal Giard

This work presents a fast successive-cancellation list flip (Fast-SCLF) decoding algorithm for polar codes that addresses the high latency issue associated with the successive-cancellation list flip (SCLF) decoding algorithm. We first…

Information Theory · Computer Science 2022-01-25 Nghia Doan , Seyyed Ali Hashemi , Warren J. Gross

This paper introduces algorithms for the successive-cancellation decoding and the successive-cancellation list decoding of binary polar source/channel codes. By using the symmetric parametrization of conditional probability, we reduce both…

Information Theory · Computer Science 2021-01-22 Jun Muramatsu

Polar codes are a class of channel capacity achieving codes that has been selected for the next generation of wireless communication standards. Successive-cancellation (SC) is the first proposed decoding algorithm, suffering from mediocre…

Information Theory · Computer Science 2018-10-09 Furkan Ercan , Carlo Condo , Seyyed Ali Hashemi , Warren J. Gross

Successive cancellation list (SCL) decoding has been widely adopted for polar codes, which allows near maximum likelihood performance with sufficiently large list size. In this work, we show that, if the list size is $2^\gamma$, where…

Information Theory · Computer Science 2025-07-23 Alexander Sauter , Mustafa Cemil Coşkun , Gianluigi Liva

Due to the low-latency and high-reliability requirements of 5G, low-complexity node-based successive cancellation list (SCL) decoding has received considerable attention for use in 5G communications systems. By identifying special…

Information Theory · Computer Science 2022-12-21 Yuqing Ren , Andreas Toftegaard Kristensen , Yifei Shen , Alexios Balatsoukas-Stimming , Chuan Zhang , Andreas Burg

Non-binary polar codes (NBPCs) decoded by successive cancellation (SC) algorithm have remarkable bit-error-rate performance compared to the binary polar codes (BPCs). Due to the serial nature, SC decoding suffers from large latency. The…

Information Theory · Computer Science 2024-01-17 Ali Farsiabi , Hamid Ebrahimzad , Masoud Ardakani , Chuandong Li

The soft-output successive cancellation list (SOSCL) decoder provides a methodology for estimating the a-posteriori probability log-likelihood ratios by only leveraging the conventional SCL decoder for polar codes. However, the sequential…

Information Theory · Computer Science 2024-12-24 Li Shen , Yongpeng Wu , Yin Xu , Xiaohu You , Xiqi Gao , Wenjun Zhang

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