English
Related papers

Related papers: Improved List Decoding for Polar-Coded Probabilist…

200 papers

A new permutation decoding approach for polar codes is presented. The complexity of the algorithm is similar to that of a successive cancellation list (SCL) decoder, while it can be implemented with the latency of a successive cancellation…

Information Theory · Computer Science 2019-01-18 Mikhail Kamenev , Yulia Kameneva , Oleg Kurmaev , Alexey Maevskiy

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

A deep-learning-aided successive-cancellation list (DL-SCL) decoding algorithm for polar codes is introduced with deep-learning-aided successive-cancellation (DL-SC) decoding being a specific case of it. The DL-SCL decoder works by allowing…

Information Theory · Computer Science 2019-12-04 Seyyed Ali Hashemi , Nghia Doan , Thibaud Tonnellier , Warren J. Gross

A heuristic construction of polar codes for successive cancellation list (SCL) decoding with a given list size is proposed to balance the trade-off between performance measured in frame error rate (FER) and decoding complexity. Furthermore,…

Information Theory · Computer Science 2018-08-03 Peihong Yuan , Tobias Prinz , Georg Böcherer , Onurcan İşcan , Ronald Böhnke , Wen Xu

As improved versions of successive cancellation (SC) decoding algorithm, successive cancellation list (SCL) decoding and successive cancellation stack (SCS) decoding are used to improve the finite-length performance of polar codes. Unified…

Information Theory · Computer Science 2016-11-15 Kai Chen , Kai Niu , Jia-Ru Lin

For polar codes, successive cancellation list (SCL) decoding algorithm significantly improves finite-length performance compared to SC decoding. SCL-flip decoding can further enhance the performance but the gain diminishes as code length…

Information Theory · Computer Science 2024-07-08 Xianbin Wang , Huazi Zhang , Jiajie Tong , Jun Wang , Wen Tong

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

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 represent one of the major recent breakthroughs in coding theory and, because of their attractive features, they have been selected for the incoming 5G standard. As such, a lot of attention has been devoted to the development of…

Information Theory · Computer Science 2017-08-31 Seyyed Ali Hashemi , Marco Mondelli , S. Hamed Hassani , Rudiger Urbanke , Warren J. Gross

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

Polar codes are capacity achieving error correcting codes that can be decoded through the successive-cancellation algorithm. To improve its error-correction performance, a list-based version called successive-cancellation list (SCL) has…

Information Theory · Computer Science 2017-01-30 Seyyed Ali Hashemi , Carlo Condo , Warren J. Gross

Successive cancellation list (SCL) decoding algorithm is a powerful method that can help polar codes achieve excellent error-correcting performance. However, the current SCL algorithm and decoders are based on likelihood or log-likelihood…

Information Theory · Computer Science 2014-12-16 Bo Yuan , Keshab K. Parhi

Successive cancellation list (SCL) decoders of polar codes excel in practical performance but pose challenges for theoretical analysis. Existing works either limit their scope to erasure channels or address general channels without taking…

Information Theory · Computer Science 2024-05-28 Hsin-Po Wang , Venkatesan Guruswami

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

Bit flipping can be used as a postprocessing technique to further improve the performance for successive cancellation list (SCL) decoding of polar codes. However, the number of bit-flipping trials could increase the decoding latency…

Information Theory · Computer Science 2023-06-06 Wei Zhang , Xiaofu Wu

Due to their capacity-achieving property, polar codes have become one of the most attractive channel codes. To date, the successive cancellation list (SCL) decoding algorithm is the primary approach that can guarantee outstanding…

Information Theory · Computer Science 2016-11-18 Bo Yuan , Keshab K. Parhi

Under successive cancellation (SC) decoding, polar codes are inferior to other codes of similar blocklength in terms of frame error rate. While more sophisticated decoding algorithms such as list- or stack-decoding partially mitigate this…

Information Theory · Computer Science 2014-12-18 Orion Afisiadis , Alexios Balatsoukas-Stimming , Andreas Burg

Polar codes are of great interests because they provably achieve the capacity of both discrete and continuous memoryless channels while having an explicit construction. Most existing decoding algorithms of polar codes are based on bit-wise…

Information Theory · Computer Science 2016-01-20 Chenrong Xiong , Jun Lin , Zhiyuan Yan

Polar codes have gained significant amount of attention during the past few years and have been selected as a coding scheme for the next generation of mobile broadband standard. Among decoding schemes, successive-cancellation list (SCL)…

Information Theory · Computer Science 2017-08-31 Seyyed Ali Hashemi , Carlo Condo , Warren J. Gross
‹ Prev 1 2 3 10 Next ›