English
Related papers

Related papers: Fast Encoding and Decoding of Flexible-Rate and Fl…

200 papers

In this work, we present hardware and software implementations of flexible polar systematic encoders and decoders. The proposed implementations operate on polar codes of any length less than a maximum and of any rate. We describe the…

Information Theory · Computer Science 2016-08-29 Gabi Sarkis , Ido Tal , Pascal Giard , Alexander Vardy , Claude Thibeault , 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 provably achieve the symmetric capacity of a memoryless channel while having an explicit construction. This work aims to increase the throughput of polar decoder hardware by an order of magnitude relative to the state of the art…

Hardware Architecture · Computer Science 2015-05-20 Gabi Sarkis , Pascal Giard , Alexander Vardy , Claude Thibeault , Warren J. Gross

The so-called fast polar decoding schedules are meant to improve the decoding speed of the sequential-natured successive cancellation list decoders. The decoding speedup is achieved by replacing various parts of the serial decoding process…

Information Theory · Computer Science 2024-06-21 Syed Aizaz Ali Shah , Gerhard Bauch

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 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 able to achieve the capacity of memoryless channels under successive cancellation (SC) decoding. Soft Cancellation (SCAN) is a soft-output decoder based on the SC schedule, useful in iterative decoding and concatenation of…

Information Theory · Computer Science 2020-04-09 Charles Pillet , Carlo Condo , Valerio Bioglio

A reduced complexity sequential decoding algorithm for polar (sub)codes is described. The proposed approach relies on a decomposition of the polar (sub)code being decoded into a number of outer codes, and on-demand construction of codewords…

Information Theory · Computer Science 2020-07-08 Grigorii Trofimiuk , Nikolay Iakuba , Stanislav Rets , Kirill Ivanov , Peter Trifonov

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

Polar codes are an exciting new class of error correcting codes that achieve the symmetric capacity of memoryless channels. Many decoding algorithms were developed and implemented, addressing various application requirements: from…

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

Targeting high-throughput and low-power communications, we implement two successive cancellation (SC) decoders for polar codes. With $16nm$ ASIC technology, the area efficiency and energy efficiency are $4Tbps/mm^2$ and $0.63pJ/bit$,…

Information Theory · Computer Science 2021-07-20 Jiajie Tong , Xianbin Wang , Qifan Zhang , Huazi Zhang , Rong Li , Jun Wang , Wen Tong

In this letter, we propose parallel SC (Successive Cancellation) decoder and parallel SC-List decoder for polar codes. The parallel decoder is composed of M=2^m(m>=1) component decoders working in parallel and each component decoder decodes…

Information Theory · Computer Science 2013-09-05 Bin Li , Hui Shen , David Tse

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

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…

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

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

The recently-discovered polar codes are widely seen as a major breakthrough in coding theory. These codes achieve the capacity of many important channels under successive cancellation decoding. Motivated by the rapid progress in the theory…

Hardware Architecture · Computer Science 2015-03-17 Camille Leroux , Ido Tal , Alexander Vardy , 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
‹ Prev 1 2 3 10 Next ›