English
Related papers

Related papers: Circular Buffer Rate-Matched Polar Codes

200 papers

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

Recently, automorphism ensemble decoding (AED) has drawn research interest as a more computationally efficient alternative to successive cancellation list (SCL) decoding of polar codes. Although AED has demonstrated superior performance for…

Information Theory · Computer Science 2023-05-03 Marvin Geiselhart , Jannis Clausius , Stephan ten Brink

Concatenating the state-of-the-art codes at moderate rates with repetition codes has emerged as a practical solution deployed in various standards for ultra-low-power devices such as in Internet-of-Things (IoT) networks. In this paper, we…

Information Theory · Computer Science 2022-03-24 Fariba Abbasi , Hessam Mahdavifar , Emanuele Viterbo

Polar codes are a family of capacity-achieving error-correcting codes, and they have been selected as part of the next generation wireless communication standard. Each polar code bit-channel is assigned a reliability value, used to…

Information Theory · Computer Science 2017-05-17 Carlo Condo , Seyyed Ali Hashemi , Warren J. Gross

The long-haul communication systems can offer ultra high-speed data transfer rates but suffer from burst errors. The high-rate and high-performance staircase codes provide an efficient way for long-haul transmission. The staircase coding…

Information Theory · Computer Science 2018-05-28 Bowen Feng , Jian Jiao , Liu Zhou , Shaohua Wu , Bin Cao , Qinyu Zhang

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

The problem of polar coding for an arbitrary sequence of independent binary-input memoryless symmetric (BMS) channels $\left\{W_i\right\}_{i=1}^{N}$ is considered. The sequence of channels is assumed to be completely known to both the…

Information Theory · Computer Science 2020-08-27 Hessam Mahdavifar

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 codes are a class of error-correcting codes that provably achieve the capacity of practical channels under the low-complexity successive-cancellation flip (SCF) decoding algorithm. However, the SCF decoding algorithm has a variable…

Information Theory · Computer Science 2024-09-06 Ilshat Sagitov , Charles Pillet , Pascal Giard

A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity $I(W)$ of any given binary-input discrete memoryless channel (B-DMC) $W$. The symmetric capacity is the highest rate…

Information Theory · Computer Science 2016-11-18 Erdal Arikan

In this paper, we investigate the fundamentals of puncturing and shortening for polar codes, based on binary domination which plays a key role in polar code construction. We first prove that the orders of encoder input bits to be made…

Information Theory · Computer Science 2019-01-09 Min Jang , Seok-Ki Ahn , Hongsil Jeong , Kyung-Joong Kim , Seho Myung , Sang-Hyo Kim , Kyeongcheol Yang

In this paper, we study polar codes from a practical point of view. In particular, we study concatenated polar codes and rate-compatible polar codes. First, we propose a concatenation scheme including polar codes and Low-Density…

Information Theory · Computer Science 2011-07-28 Ali Eslami , Hossein Pishro-Nik

Recently, a new class of error-control codes, the polar codes, have attracted much attention. The polar codes are the first known class of capacity-achieving codes for many important communication channels. In addition, polar codes have…

Information Theory · Computer Science 2012-11-19 Xudong Ma

Polar codes are the first class of constructive channel codes achieving the symmetric capacity of the binary-input discrete memoryless channels. But the corresponding code length is limited to the power of two. In this paper, we establish a…

Information Theory · Computer Science 2017-12-05 Kai Niu , Jincheng Dai , Kai Chen , Jiaru Lin , Q. T. Zhang , Athanasios V. Vasilakos

We develop a low-complexity polar coding scheme for the discrete memoryless broadcast channel with confidential messages under strong secrecy and randomness constraints. Our scheme extends previous work by using an optimal rate of uniform…

Information Theory · Computer Science 2016-03-08 Remi A. Chou , Matthieu R. Bloch

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

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

We consider the joint design of polar coding and higher-order modulation schemes for ever increased spectral efficiency. The close connection between the polar code construction and the multi-level coding approach is described in detail.…

Information Theory · Computer Science 2012-11-30 Mathis Seidl , Andreas Schenk , Clemens Stierstorfer , Johannes B. Huber

This paper presents a puncturing technique based on the channel polarization index for the design of rate-compatible polar codes in the fifth generation (5G) of wireless systems. The proposed strategy consists of two steps: we first…

Information Theory · Computer Science 2018-12-11 R. M. Oliveira , R. C. de Lamare

Achieving security against adversaries with unlimited computational power is of great interest in a communication scenario. Since polar codes are capacity achieving codes with low encoding-decoding complexity and they can approach perfect…

Information Theory · Computer Science 2018-01-23 Amirsina Torfi , Sobhan Soleymani , Siamak Aram , Vahid Tabataba Vakili