English
Related papers

Related papers: Hardware Decoders for Polar Codes: An Overview

200 papers

We present a rate-compatible polar coding scheme that achieves the capacity of any family of channels. Our solution generalizes the previous results [1], [2] that provide capacity-achieving rate-compatible polar codes for a degraded family…

Information Theory · Computer Science 2017-01-24 Marco Mondelli , S. Hamed Hassani , Ivana Marić , Dennis Hui , Song-Nam Hong

Owing to its high parallelism, belief propagation (BP) decoding is highly amenable to high-throughput implementations and thus represents a promising solution for meeting the ultra-high peak data rate of future communication systems.…

We exploit the redundancy of the language-based source to help polar decoding. By judging the validity of decoded words in the decoded sequence with the help of a dictionary, the polar list decoder constantly detects erroneous paths after…

Information Theory · Computer Science 2020-07-24 Ying Wang , Minghai Qin , Krishna R. Narayanan , Anxiao Jiang , Zvonimir Bandic

Polar codes are the first class of error correcting codes that provably achieve the channel capacity at infinite code length. They were selected for use in the fifth generation of cellular mobile communications (5G). In practical scenarios…

Information Theory · Computer Science 2018-11-02 Nghia Doan , Seyyed Ali Hashemi , Elie Ngomseu Mambou , Thibaud Tonnellier , Warren J. Gross

The recently introduced polar codes constitute a breakthrough in coding theory due to their capacityachieving property. This goes hand in hand with a quasilinear construction, encoding, and successive cancellation list decoding procedures…

Information Theory · Computer Science 2021-10-19 Kirill Ivanov , Rüdiger Urbanke

A rateless coding scheme transmits incrementally more and more coded bits over an unknown channel until all the information bits are decoded reliably by the receiver. We propose a new rateless coding scheme based on polar codes, and we show…

Information Theory · Computer Science 2015-08-14 Bin Li , David Tse , Kai Chen , Hui Shen

Motivated by the significant performance gains which polar codes experience under successive cancellation list decoding, their scaling exponent is studied as a function of the list size. In particular, the error probability is fixed and the…

Information Theory · Computer Science 2014-09-23 Marco Mondelli , S. Hamed Hassani , Rüdiger Urbanke

A novel construction of polar codes with dynamic frozen symbols is proposed. The proposed codes are subcodes of extended BCH codes, which ensure sufficiently high minimum distance. Furthermore, a decoding algorithm is proposed, which…

Information Theory · Computer Science 2013-07-12 Peter Trifonov , Vera Miloslavskaya

Polar codes have attracted a lot of attention during past few years and have been adopted as a coding scheme for 5G standard. Successive-cancellation list (SCL) decoder provides high level error-correction performance for polar codes, but…

Information Theory · Computer Science 2019-04-25 Liang Ma , Hang Li , Yuejun Wei

Polar-coded multiple-input multiple-output systems are investigated. An advanced receiver implementing joint list decoding of polar codes and QR- and MMSE-based detectors is proposed. The approximate and exact path metrics are derived for…

Information Theory · Computer Science 2025-08-29 Liudmila Karakchieva , Peter Trifonov

Polar coding is a recently proposed coding technique that can provably achieve the channel capacity. The polar code structure, which is based on the original 2x2 generator matrix, polarises the channels, i.e., a portion of the channel…

Information Theory · Computer Science 2019-01-08 Berksan Serbetci , Ali Emre Pusane

This paper deals with two main issues regarding the short polar codes: the potential of FEC-assisted decoding and optimal code concatenation strategies under various design scenarios. Code concatenation and FEC-assisted decoding are…

Information Theory · Computer Science 2016-07-26 Mohammad Sadegh Mohammadi , Eryk Dutkiewicz , Qi Zhang

Polar codes is promising because they can provably achieve the channel capacity while having an explicit construction method. Lots of work have been done for the bit-based decoding algorithm for polar codes. In this paper, generalized…

Information Theory · Computer Science 2016-11-15 Chenrong Xiong , Jun Lin , Zhiyuan Yan

Polar codes were introduced in 2009 and proven to achieve the symmetric capacity of any binary-input discrete memoryless channel under low-complexity successive cancellation decoding. In this thesis, we construct cyclic polar codes based on…

Information Theory · Computer Science 2020-04-16 Narayanan Rengaswamy

We study the application of polar codes in deletion channels by analyzing the cascade of a binary erasure channel (BEC) and a deletion channel. We show how polar codes can be used effectively on a BEC with a single deletion, and propose a…

Information Theory · Computer Science 2017-01-10 Eldho K. Thomas , Vincent Y. F. Tan , Alexander Vardy , Mehul Motani

It is shown that polar coding schemes achieve the known achievable rate regions for several multi-terminal communications problems including lossy distributed source coding, multiple access channels and multiple descriptions coding. The…

Information Theory · Computer Science 2014-04-29 Aria G. Sahebi , S. Sandeep Pradhan

When a neural network (NN) is used to decode a polar code, its training complexity scales exponentially as the code block size (or to be precise, as a number of message bits) increases. Therefore, existing solutions that use a neural…

Information Theory · Computer Science 2022-11-10 Evgeny Stupachenko

In this paper, we design a polar decoding platform for diverse application scenarios that require low-cost and low-power communications. Specifically, prevalent polar decoders such as successive cancellation (SC), SC-list (SCL) and Fano…

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

We study the use of polar codes for both discrete and continuous variables Quantum Key Distribution (QKD). Although very large blocks must be used to obtain the efficiency required by quantum key distribution, and especially continuous…

Quantum Physics · Physics 2013-07-30 Paul Jouguet , Sébastien Kunz-Jacques

We improve the method in \cite{Seidl:10} for increasing the finite-lengh performance of polar codes by protecting specific, less reliable symbols with simple outer repetition codes. Decoding of the scheme integrates easily in the known…

Information Theory · Computer Science 2013-12-11 Mathis Seidl , Johannes B. Huber