English
Related papers

Related papers: A Multi-Gbps Unrolled Hardware List Decoder for a …

200 papers

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

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

Research on polar codes has been constantly gaining attention over the last decade, by academia and industry alike, thanks to their capacity-achieving error-correction performance and low-complexity decoding algorithms. Recently, they have…

Information Theory · Computer Science 2020-06-25 Carlo Condo , Valerio Bioglio , Ingmar Land

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

Flexibility is one mandatory aspect of channel coding in modern wireless communication systems. Among other things, the channel decoder has to support several code lengths and code rates. This need for flexibility applies to polar codes…

Information Theory · Computer Science 2017-10-24 Mathieu Léonardon , Adrien Cassagne , Camille Leroux , Christophe Jégo , Louis-Philippe Hamelin , Yvon Savaria

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

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 have been gaining a lot of interest due to it being the first coding scheme to provably achieve the symmetric capacity of a binary memoryless channel with an explicit construction. However, the main drawback of polar codes is…

Information Theory · Computer Science 2019-11-11 Heshani Gamage , Vismika Ranasinghe , Nandana Rajatheva , Matti Latva-aho

This work presents a high throughput and energy efficient multicore (MC) successive cancellation (SC) decoder architecture for polar codes. SC is a low-complexity decoding algorithm with a set of sequential operations. The sequential…

Hardware Architecture · Computer Science 2021-08-30 Altuğ Süral , Ertuğrul Kolağasıoğlu

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

This work presents an efficient ASIC implementation of successive cancellation (SC) decoder for polar codes. SC is a low-complexity depth-first search decoding algorithm, favorable for beyond-5G applications that require extremely high…

Hardware Architecture · Computer Science 2020-09-22 Altuğ Süral , E. Göksu Sezer , Ertuğrul Kolağasıoğlu , Veerle Derudder , Kaoutar Bertrand

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

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

Due to the sequential nature of the successive-cancellation (SC) algorithm, the decoding of polar codes suffers from significant decoding latencies. Fast SC decoding is able to speed up the SC decoding process, by implementing parallel…

Information Theory · Computer Science 2022-11-21 Yang Lu , Ming-Min Zhao , Ming Lei , Min-Jian Zhao

The discovery of suitable automorphisms of polar codes gained a lot of attention by applying them in Automorphism Ensemble Decoding (AED) to improve the error-correction performance, especially for short block lengths. This paper introduces…

Information Theory · Computer Science 2023-06-29 Lucas Johannsen , Claus Kestel , Marvin Geiselhart , Timo Vogt , Stephan ten Brink , Norbert Wehn

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 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

We present a hardware architecture and algorithmic improvements for list SC decoding of polar codes. More specifically, we show how to completely avoid copying of the likelihoods, which is algorithmically the most cumbersome part of list SC…

Information Theory · Computer Science 2014-02-28 A. Balatsoukas-Stimming , A. J. Raymond , W. J. Gross , A. Burg

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

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