English
Related papers

Related papers: Efficient Partial Rewind of Polar Codes' Successiv…

200 papers

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

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 a class of linear block codes that provably achieves channel capacity. They have been selected as a coding scheme for the control channel of enhanced mobile broadband (eMBB) scenario for $5^{\text{th}}$ generation wireless…

Hardware Architecture · Computer Science 2020-06-04 Furkan Ercan , Thibaud Tonnellier , Carlo Condo , Warren J. Gross

Simulation results illustrating the performance and complexity of the sequential successive cancellation decoding algorithm are presented for the case of polar subcodes with Arikan and large kernels, as well as for extended BCH\ codes.…

Information Theory · Computer Science 2020-12-16 Peter Trifonov

This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements $P$ that can perform SSC…

Information Theory · Computer Science 2020-12-25 Seyyed Ali Hashemi , Marco Mondelli , Arman Fazeli , Alexander Vardy , John Cioffi , Andrea Goldsmith

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

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

Polar codes are the first codes with a proven capacity-achieving capability, but their decoding faces several challenges, especially under long code lengths. In this paper, we target algorithmic improvements and analyses to enable the…

Information Theory · Computer Science 2026-05-22 Jiajie Li , Sihui Shen , Warren J. Gross

The so-called fast polar decoding schedules are meant to improve the decoding speed of the sequential-natured successive cancellation list decoders. The decoding speedup is achieved by replacing various parts of the serial decoding process…

Information Theory · Computer Science 2024-06-21 Syed Aizaz Ali Shah , Gerhard Bauch

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

In this paper we propose an enhanced soft cancellation (SCAN) decoder for polar codes based on decoding stages permutation. The proposed soft cancellation list (SCANL) decoder runs $L$ independent SCAN decoders, each one relying on a…

Information Theory · Computer Science 2020-01-31 Charles Pillet , Carlo Condo , Valerio Bioglio

In successive cancellation list (SCL) decoding, the tree pruning operation retains the L best paths with respect to metric at every decoding step. However, the correct path might be among the L worst paths due to imposed penalties. In this…

Information Theory · Computer Science 2020-01-30 Mohammad Rowshan , Emanuele Viterbo

We describe a successive-cancellation \emph{list} decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Ar{\i}kan. In the proposed list decoder, up to $L$ decoding paths are considered…

Information Theory · Computer Science 2012-06-04 Ido Tal , Alexander Vardy

Polar codes achieve outstanding error correction performance when using successive cancellation list (SCL) decoding with cyclic redundancy check. A larger list size brings better decoding performance and is essential for practical…

Signal Processing · Electrical Eng. & Systems 2019-05-03 ChenYang Xia , YouZhe Fan , Chi-Ying Tsui

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

Since its invention, polar code has received a lot of attention because of its capacity-achieving performance and low encoding and decoding complexity. Successive cancellation decoding (SCD) and belief propagation decoding (BPD) are two of…

Information Theory · Computer Science 2015-08-26 Syed Mohsin Abbas , YouZhe Fan , Ji Chen , Chi-Ying Tsui

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 have gained extensive attention during the past few years and recently they have been selected for the next generation of wireless communications standards (5G). Successive-cancellation-based (SC-based) decoders, such as SC list…

Information Theory · Computer Science 2020-01-08 Seyyed Ali Hashemi , Carlo Condo , Marco Mondelli , Warren J. Gross

Targeting high-throughput and low-power communications, we implement two successive cancellation (SC) decoders for polar codes. With $16nm$ ASIC technology, the area efficiency and energy efficiency are $4Tbps/mm^2$ and $0.63pJ/bit$,…

Information Theory · Computer Science 2021-07-20 Jiajie Tong , Xianbin Wang , Qifan Zhang , Huazi Zhang , Rong Li , Jun Wang , Wen Tong

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
‹ Prev 1 4 5 6 7 8 10 Next ›