English
Related papers

Related papers: Successive Cancellation Automorphism List Decoding…

200 papers

The URLLC scenario in the upcoming 6G standard requires low latency and ultra reliable transmission, i.e., error correction towards ML performance. Achieving near-ML performance is very challenging especially for short block lengths. Polar…

Information Theory · Computer Science 2023-03-03 Claus Kestel , Marvin Geiselhart , Lucas Johannsen , Stephan ten Brink , Norbert Wehn

In the short block length regime, pre-transformed polar codes together with successive cancellation list (SCL) decoding possess excellent error correction capabilities. However, in practice, the list size is limited due to the suboptimal…

Information Theory · Computer Science 2025-04-25 Henning Lulei , Jonathan Mandelbaum , Marvin Rübenacke , Holger Jäkel , Stephan ten Brink , Laurent Schmalen

In this paper we deal with polar code automorphisms that are beneficial under low-latency automorphism ensemble (AE) decoding, and we propose polar code designs that have such automorphisms. Successive-cancellation (SC) decoding and thus…

Information Theory · Computer Science 2021-09-06 Charles Pillet , Valerio Bioglio , Ingmar Land

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

Recently, automorphism ensemble decoding (AED) has drawn research interest as a more computationally efficient alternative to successive cancellation list (SCL) decoding of polar codes. Although AED has demonstrated superior performance for…

Information Theory · Computer Science 2023-05-03 Marvin Geiselhart , Jannis Clausius , Stephan ten Brink

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

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

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 the first class of structured channel codes that achieve the symmetric capacity of binary channels with efficient encoding and decoding. In 2019, Arikan proposed a new polar coding scheme referred to as polarization-adjusted…

Information Theory · Computer Science 2024-01-30 Hamid Saber , Homayoon Hatami , Jung Hyun Bae

Automorphism ensemble (AE) decoding for polar codes was proposed by decoding permuted codewords with successive cancellation (SC) decoders in parallel and hence has lower latency compared to that of successive cancellation list (SCL)…

Information Theory · Computer Science 2022-06-24 Zicheng Ye , Yuan Li , Huazi Zhang , Rong Li , Jun Wang , Guiying Yan , Zhiming Ma

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 new class of block codes with an explicit construction that provably achieve the capacity of various communications channels, even with the low-complexity successive-cancellation (SC) decoding algorithm. Yet, the more…

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

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

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

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

In this paper, we propose a data-driven algorithm to design rate- and length-flexible polar codes. While the algorithm is very general, a particularly appealing use case is the design of codes for automorphism ensemble decoding (AED), a…

Information Theory · Computer Science 2025-10-08 Marvin Rübenacke , Andreas Zunker , Felix Krieg , Stephan ten Brink

Polar codes are the first class of capacity-achieving forward error correction (FEC) codes. They have been selected as one of the coding schemes for the 5G communication systems due to their excellent error correction performance when…

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

Polar codes are of great interest since they are the first provably capacity-achieving forward error correction codes. To improve throughput and to reduce decoding latency of polar decoders, maximum likelihood (ML) decoding units are used…

Information Theory · Computer Science 2015-10-27 Chenrong Xiong , Jun Lin , Zhiyuan Yan

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
‹ Prev 1 2 3 10 Next ›