English
Related papers

Related papers: CRISP: Curriculum based Sequential Neural Decoders…

200 papers

As the first error correction codes provably achieving the symmetric capacity of binary-input discrete memory-less channels (B-DMCs), polar codes have been recently chosen by 3GPP for eMBB control channel. Among existing algorithms,…

Signal Processing · Electrical Eng. & Systems 2018-03-19 Huayi Zhou , Xiao Liang , Liping Li , Zaichen Zhang , Xiaohu You , Chuan Zhang

In this work, a novel data-driven methodology for designing polar codes for channels with and without memory is proposed. The methodology is suitable for the case where the channel is given as a "black-box" and the designer has access to…

Information Theory · Computer Science 2023-09-07 Ziv Aharoni , Bashar Huleihel , Henry D. Pfister , Haim H. Permuter

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

Polar codes are a recently proposed class of block codes that provably achieve the capacity of various communication channels. They received a lot of attention as they can do so with low-complexity encoding and decoding algorithms, and they…

Polar codes are a class of linear error correction codes which provably attain channel capacity with infinite codeword lengths. Finite length polar codes have been adopted into the 5th Generation 3GPP standard for New Radio, though their…

Information Theory · Computer Science 2019-02-07 Adam Cavatassi , Thibaud Tonnellier , Warren J. Gross

Polar codes have received growing attention in the past decade and have been selected as the coding scheme for the control channel in the fifth generation (5G) wireless communication systems. However, the conventional polar codes have only…

Information Theory · Computer Science 2023-01-26 Hossein Rezaei , Nandana Rajatheva , Matti Latva-aho

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…

Polar codes have received increasing attention in the past decade, and have been selected for the next generation of wireless communication standard. Most research on polar codes has focused on codes constructed from a $2\times2$…

Hardware Architecture · Computer Science 2018-02-05 Gabriele Coppolino , Carlo Condo , Guido Masera , Warren J. Gross

Polar codes are the first provable capacity-achieving forward error correction (FEC) codes. In general polar codes can be decoded via either successive cancellation (SC) or belief propagation (BP) decoding algorithm. However, to date…

Information Theory · Computer Science 2014-11-27 Bo Yuan , Keshab K. Parhi

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

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

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

Successive cancellation list (SCL) decoding enables polar codes and their generalizations to deliver satisfactory performance in finite-length scenarios but it comes with high latency and complexity. To reduce latency, a partitioned SCL…

Information Theory · Computer Science 2024-11-26 Xinyuanmeng Yao , Xiao Ma

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

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 have been adopted as the control channel coding scheme in the fifth generation new radio (5G NR) standard due to its capacity-achievable property. Traditional polar decoding algorithms such as successive cancellation (SC) suffer…

Signal Processing · Electrical Eng. & Systems 2019-08-02 Zhiwei Cao , Hongfei Zhu , Yuping Zhao , Dou Li

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

Polar codes are a new class of capacity-achieving error-correcting codes with low encoding and decoding complexity. Their low-complexity decoding algorithms rendering them attractive for use in software-defined radio applications where…

Information Theory · Computer Science 2016-07-12 Pascal Giard , Gabi Sarkis , Camille Leroux , Claude Thibeault , Warren J. Gross

New algorithms for efficient decoding of polar codes (which may be CRC-augmented), transmitted over either a binary erasure channel (BEC) or an additive white Gaussian noise channel (AWGNC), are presented. We start by presenting a new…

Information Theory · Computer Science 2021-07-14 Yonatan Urman , Guy Mogilevsky , David Burshtein