English
Related papers

Related papers: High Throughput Polar Decoding Using Two-Staged Ad…

200 papers

Dynamic successive cancellation flip (DSCF) decoding of polar codes is a powerful algorithm that can achieve the error correction performance of successive cancellation list (SCL) decoding, with a complexity that is close to that of…

Information Theory · Computer Science 2019-07-29 Nghia Doan , Seyyed Ali Hashemi , Furkan Ercan , Thibaud Tonnellier , Warren Gross

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

We consider practical hardware implementation of Polar decoders. To reduce latency due to the serial nature of successive cancellation (SC), existing optimizations improve parallelism with two approaches, i.e., multi-bit decision or reduced…

Information Theory · Computer Science 2018-08-07 Huazi Zhang , Jiajie Tong , Rong Li , Pengcheng Qiu , Yourui Huangfu , Chen Xu , Xianbin Wang , Jun Wang

We propose a low complexity list successive cancellation (LCLSC) decoding algorithm to reduce complexity of traditional list successive cancellation (LSC) decoding of polar codes while trying to maintain the LSC decoding performance at the…

Information Theory · Computer Science 2013-09-13 Congzhe Cao , Zesong Fei , Jinhong Yuan , Jingming Kuang

We show that successive cancellation list decoding can be formulated exclusively using log-likelihood ratios. In addition to numerical stability, the log-likelihood ratio based formulation has useful properties which simplify the sorting…

Information Theory · Computer Science 2016-02-15 Alexios Balatsoukas-Stimming , Mani Bastani Parizi , Andreas Burg

The recently-discovered polar codes are seen as a major breakthrough in coding theory; they provably achieve the theoretical capacity of discrete memoryless channels using the low complexity successive cancellation (SC) decoding algorithm.…

Hardware Architecture · Computer Science 2015-03-19 Camille Leroux , Alexandre J. Raymond , Gabi Sarkis , Ido Tal , Alexander Vardy , Warren J. Gross

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

Blind recognition of polar codes remains challenging in non-cooperative scenarios, particularly for information-set recognition with known code length. Existing methods mainly rely on threshold decisions determined by the generator-matrix…

Information Theory · Computer Science 2026-05-14 Changwei Tu , Yang Liu , Xianzhao Feng , Kai Niu

SC-Flip (SCF) is a low-complexity polar code decoding algorithm with improved performance, and is an alternative to high-complexity (CRC)-aided SC-List (CA-SCL) decoding. However, the performance improvement of SCF is limited since it can…

Information Theory · Computer Science 2020-09-22 Furkan Ercan , Thibaud Tonnellier , Nghia Doan , Warren J. Gross

This paper presents a refined analysis of the block error rate (BLER) of polar codes over symmetric binary-input discrete memoryless channels under successive cancellation (SC) and successive cancellation list (SCL) decoding. A novel…

Information Theory · Computer Science 2026-03-23 Hassan Noghrei , Murad Abdullah

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

We propose a new framework for constructing polar codes (i.e., selecting the frozen bit positions) for arbitrary channels, and tailored to a given decoding algorithm, rather than based on the (not necessarily optimal) assumption of…

Information Theory · Computer Science 2019-01-31 Ahmed Elkelesh , Moustafa Ebada , Sebastian Cammerer , Stephan ten Brink

Motivated by the need to communicate short control messages in 5G and beyond, this paper carefully designs codes for cyclic redundancy check (CRC)-aided list decoding of tail-biting convolutional codes (TBCCs) and polar codes. Both codes…

Information Theory · Computer Science 2023-02-16 Jacob King , Hanwen Yao , William Ryan , Richard D. Wesel

This paper explores list decoding of convolutional and polar codes for short messages such as those found in the 5G physical broadcast channel. A cyclic redundancy check (CRC) is used to select a codeword from a list of likely codewords.…

Information Theory · Computer Science 2022-01-21 Jacob King , Alexandra Kwon , Hengjie Yang , William Ryan , Richard D. Wesel

In this letter, we propose parallel SC (Successive Cancellation) decoder and parallel SC-List decoder for polar codes. The parallel decoder is composed of M=2^m(m>=1) component decoders working in parallel and each component decoder decodes…

Information Theory · Computer Science 2013-09-05 Bin Li , Hui Shen , David Tse

Nowadays polar codes are becoming one of the most favorable capacity achieving error correction codes for their low encoding and decoding complexity. However, due to the large code length required by practical applications, the few existing…

Hardware Architecture · Computer Science 2011-11-04 Chuan Zhang , Bo Yuan , Keshab K. Parhi

Polar codes are an exciting new class of error correcting codes that achieve the symmetric capacity of memoryless channels. Many decoding algorithms were developed and implemented, addressing various application requirements: from…

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. For very high-throughput…

Signal Processing · Electrical Eng. & Systems 2026-05-28 Marwan Jalaleddine , Mohamad Ali Jarkas , 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 have been selected as the channel coding scheme for control channel in the fifth generation (5G) communication system thanks to their capacity achieving characteristics. However, the traditional polar codes support only codes…

Information Theory · Computer Science 2023-05-16 Hossein Rezaei , Nandana Rajatheva , Matti Latva-aho
‹ Prev 1 4 5 6 7 8 10 Next ›