English
Related papers

Related papers: Rate-Flexible Fast Polar Decoders

200 papers

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

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

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

Polar codes are widely considered as one of the most exciting recent discoveries in channel coding. For short to moderate block lengths, their error-correction performance under list decoding can outperform that of other modern…

Signal Processing · Electrical Eng. & Systems 2018-06-06 Pascal Giard , Andreas Burg

This work presents a fast successive-cancellation list flip (Fast-SCLF) decoding algorithm for polar codes that addresses the high latency issue associated with the successive-cancellation list flip (SCLF) decoding algorithm. We first…

Information Theory · Computer Science 2022-01-25 Nghia Doan , Seyyed Ali Hashemi , Warren J. Gross

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

Polar codes are capacity-achieving error-correcting codes with an explicit construction that can be decoded with low-complexity algorithms. In this work, we show how the state-of-the-art low-complexity decoding algorithm can be improved to…

Information Theory · Computer Science 2016-08-29 Pascal Giard , Alexios Balatsoukas-Stimming , Gabi Sarkis , Claude Thibeault , Warren J. Gross

Polar codes are a class of capacity achieving error correcting codes that has been recently selected for the next generation of wireless communication standards (5G). Polar code decoding algorithms have evolved in various directions,…

Information Theory · Computer Science 2017-10-16 Furkan Ercan , Carlo Condo , Seyyed Ali Hashemi , Warren J. Gross

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

Due to the ability to provide superior error-correction performance, the successive cancellation list (SCL) algorithm is widely regarded as one of the most promising decoding algorithms for polar codes with short-to-moderate code lengths.…

Information Theory · Computer Science 2023-11-15 Yang Lu , Ming-Min Zhao , Ming Lei , Min-Jian Zhao

Long polar codes can achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. However, for polar codes with short and moderate code length,…

Hardware Architecture · Computer Science 2014-11-18 Jun Lin , Zhiyuan Yan

Fast SC decoding overcomes the latency caused by the serial nature of the SC decoding by identifying new nodes in the upper levels of the SC decoding tree and implementing their fast parallel decoders. In this work, we first present a novel…

Node-based successive cancellation list (SCL) decoding has received considerable attention in wireless communications for its significant reduction in decoding latency, particularly with 5G New Radio (NR) polar codes. However, the existing…

Hardware Architecture · Computer Science 2024-08-09 Yuqing Ren , Leyu Zhang , Ludovic Damien Blanc , Yifei Shen , Xinwei Li , Alexios Balatsoukas-Stimming , Chuan Zhang , Andreas Burg

Polar codes are a class of channel capacity achieving codes that has been selected for the next generation of wireless communication standards. Successive-cancellation (SC) is the first proposed decoding algorithm, suffering from mediocre…

Information Theory · Computer Science 2018-10-09 Furkan Ercan , Carlo Condo , Seyyed Ali Hashemi , Warren J. Gross

Even though polar codes were adopted in the latest 5G cellular standard, they still have the fundamental problem of high decoding latency. Aiming at solving this problem, a fast simplified successive cancellation (Fast-SSC) decoder based on…

Information Theory · Computer Science 2020-08-20 Haotian Zheng , Alexios Balatsoukas-Stimming , Zizheng Cao , Ton Koonen

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…

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

Polar codes asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern…

Information Theory · Computer Science 2015-12-25 Gabi Sarkis , Pascal Giard , Alexander Vardy , Claude Thibeault , Warren J. Gross

Polar codes are a class of linear block codes that provably achieves channel capacity, and have been selected as a coding scheme for $5^{\rm th}$ generation wireless communication standards. Successive-cancellation (SC) decoding of polar…

Information Theory · Computer Science 2018-09-28 Carlo Condo , Furkan Ercan , Warren J. Gross
‹ Prev 1 2 3 10 Next ›