English
Related papers

Related papers: A Practical Approach to Polar Codes

200 papers

In this paper, we present an efficient method to construct a good rate-compatible punctured polar (RCPP) code. One of the major challenges on the construction of a RCPP code is to design a common information set which is good for all the…

Information Theory · Computer Science 2018-07-03 Song-Nam Hong , Min-Oh Jeong

A framework is proposed that allows for a joint description and optimization of both binary polar coding and $2^m$-ary digital pulse-amplitude modulation (PAM) schemes such as multilevel coding (MLC) and bit-interleaved coded modulation…

Information Theory · Computer Science 2013-02-13 Mathis Seidl , Andreas Schenk , Clemens Stierstorfer , Johannes B. Huber

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

In this paper, we propose new coupled codes constructed by overlapping circular spatially-coupled low-density parity-check (SC-LDPC) codes, which show better asymptotic and finite-length decoding performance compared to the conventional…

Information Theory · Computer Science 2018-03-28 Heeyoul Kwak , Bohwan Jun , Pilwoong Yang , Jong-Seon No , Dong-Joon Shin

Similar to existing codes, puncturing and shortening are two general ways to obtain an arbitrary code length and code rate for polar codes. When some of the coded bits are punctured or shortened, it is equivalent to a situation in which the…

Information Theory · Computer Science 2019-10-23 Wei Song , Yifei Shen , Liping Li , Kai Niu , Chuan Zhang

We show that polar codes can be used to achieve the rate-distortion functions in the problem of hierarchical source coding also known as the successive refinement problem. We also analyze the distributed version of this problem,…

Information Theory · Computer Science 2015-09-22 Min Ye , Alexander Barg

Typically, forward error correction (FEC) codes are designed based on the minimization of the error rate for a given code rate. However, for applications that incorporate hybrid automatic repeat request (HARQ) protocol and adaptive…

Information Theory · Computer Science 2018-11-07 Hossein Khoshnevis , Ian Marsland , Halim Yanikomeroglu

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

Product codes are widespread in optical communications, thanks to their high throughput and good error-correction performance. Systematic polar codes have been recently considered as component codes for product codes. In this paper, we…

Information Theory · Computer Science 2019-01-23 Valerio Bioglio , Carlo Condo , Ingmar Land

This paper proposes the design of polar and convolutional coset codes for the unequal message protection (UMP) in the short blocklength regime, to overcome the rate loss introduced by preamble-based solutions. After providing conditions to…

Information Theory · Computer Science 2026-04-21 Alexander Sauter , Riccardo Schiavone , Lucía Balsa Picado , Gianluigi Liva

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

An implementation-efficient finite alphabet decoder for polar codes relying on coarsely quantized messages and low-complexity operations is proposed. Typically, finite alphabet decoding performs concatenated compression operations on the…

Information Theory · Computer Science 2023-05-29 Philipp Mohr , Syed Aizaz Ali Shah , Gerhard Bauch

We consider spatially coupled low-density parity-check codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing…

Information Theory · Computer Science 2017-01-27 Laurent Schmalen , Vahid Aref , Fanny Jardel

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

Low-density parity-check (LDPC) coding for a multitude of equal-capacity channels is studied. First, based on numerous observations, a conjecture is stated that when the belief propagation decoder converges on a set of equal-capacity…

Information Theory · Computer Science 2016-11-17 Ali Sanaei , Mahdi Ramezani , Masoud Ardakani

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

In this paper, we introduce a new coding and decoding structure for enhancing the reliability and performance of polar codes, specifically at low error rates. We achieve this by concatenating two polar codes in series to create robust…

Information Theory · Computer Science 2023-11-07 Mohammed Mensouri , Mustapha Eddahibi

A hybrid automatic repeat request (HARQ) scheme based on a novel class of rate-compatible polar (\mbox{RCP}) codes are proposed. The RCP codes are constructed by performing punctures and repetitions on the conventional polar codes.…

Information Theory · Computer Science 2016-11-17 Kai Chen , Kai Niu , Jiaru Lin

Polar codes have promising error-correction capabilities. Yet, decoding polar codes is often challenging, particularly with large blocks, with recently proposed decoders based on list-decoding or neural-decoding. The former applies multiple…

Information Theory · Computer Science 2023-02-14 Tomer Raviv , Alon Goldman , Ofek Vayner , Yair Be'ery , Nir Shlezinger

Systematic polar codes are shown to outperform non-systematic polar codes in terms of the bit-error-rate (BER) performance. However theoretically the mechanism behind the better performance of systematic polar codes is not yet clear. In…

Information Theory · Computer Science 2015-04-17 Liping Li , Wenyi Zhang , Yanjun Hu