English
Related papers

Related papers: On List Decoding of 5G-NR Polar Codes

200 papers

This work identifies information-theoretic quantities that are closely related to the required list size on average for successive cancellation list (SCL) decoding to implement maximum-likelihood decoding over general binary memoryless…

Information Theory · Computer Science 2022-04-04 Mustafa Cemil Coşkun , Henry D. Pfister

Polar codes have attracted the attention of numerous researchers in the past decade due to their excellent performance. However, their performance at short block lengths under standard successive cancellation decoding is far from desirable.…

Information Theory · Computer Science 2023-07-13 Wei Zhang

Sorting operation is one of the main bottlenecks for the successive-cancellation list (SCL) decoding. This paper introduces an improvement to the SCL decoding for polar and pre-transformed polar codes that reduces the number of sorting…

Information Theory · Computer Science 2022-07-26 Mohsen Moradi , Amir Mozammel

Rate-matching of low-density parity-check (LDPC) codes enables a single code description to support a wide range of code lengths and rates. In 5G NR, rate matching is accomplished by extending (lifting) a base code to a desired target…

Information Theory · Computer Science 2024-10-29 Reinhard Wiesmayr , Darja Nonaca , Chris Dick , Christoph Studer

Polar codes has been selected as 5G standard. However, only a couple of ASIC featuring decoders are fabricated,and none of them support list size L > 4 and code length N > 1024. This paper presents an ASIC implementation of three decoders…

Information Theory · Computer Science 2018-07-05 Xiaocheng Liu , Qifan Zhang , Pengcheng Qiu , Jiajie Tong , Huazi Zhang , Changyong Zhao , Jun Wang

This paper focuses on the recently introduced Successive Cancellation Flip (SCFlip) decoder of polar codes. Our contribution is twofold. First, we propose the use of an optimized metric to determine the flipping positions within the SCFlip…

Information Theory · Computer Science 2017-01-18 Ludovic Chandesris , Valentin Savin , David Declercq

We explore the relationship between polar and RM codes and we describe a coding scheme which improves upon the performance of the standard polar code at practical block lengths. Our starting point is the experimental observation that RM…

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

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 encoding, described by Arikan in IEEE Transactions on Information Theory, Vol. 55, No. 7, July 2009, was a milestone for telecommunications. A Polar code distributes information among high and low-capacity channels, showing the…

Information Theory · Computer Science 2025-07-29 Geraldo A. Barbosa

We describe a successive-cancellation \emph{list} decoder for polar codes, which is a generalization of the classic successive-cancellation decoder of Ar{\i}kan. In the proposed list decoder, up to $L$ decoding paths are considered…

Information Theory · Computer Science 2012-06-04 Ido Tal , Alexander Vardy

In this paper, we prove that any pre-transformation with an upper-triangular matrix (including cyclic redundancy check (CRC), parity-check (PC) and convolution code (CC) matrix) does not reduce the code minimum distance and an properly…

Information Theory · Computer Science 2019-12-16 Bin Li , Huazi Zhang , Jiaqi Gu

Reed-Muller (RM) and polar codes are a class of capacity-achieving channel coding schemes with the same factor graph representation. Low-complexity decoding algorithms fall short in providing a good error-correction performance for RM and…

Information Theory · Computer Science 2018-07-12 Seyyed Ali Hashemi , Nghia Doan , Marco Mondelli , Warren J. Gross

Polar codes, introduced recently by Ar\i kan, are the first family of codes known to achieve capacity of symmetric channels using a low complexity successive cancellation decoder. Although these codes, combined with successive cancellation,…

Information Theory · Computer Science 2009-05-22 Nadine Hussami , Satish Babu Korada , Rudiger Urbanke

We introduce a new family of polar-like codes, called Partially Polarized Polar (PPP) codes. PPP codes are constructed from conventional polar codes by selectively pruning polarization kernels, thereby modifying the synthesized bit-channel…

Information Theory · Computer Science 2026-01-23 Arman Fazeli , Mohammad M. Mansour , Ziyuan Zhu , Louay Jalloul

Non-binary polar codes (NBPCs) decoded by successive cancellation (SC) algorithm have remarkable bit-error-rate performance compared to the binary polar codes (BPCs). Due to the serial nature, SC decoding suffers from large latency. The…

Information Theory · Computer Science 2024-01-17 Ali Farsiabi , Hamid Ebrahimzad , Masoud Ardakani , Chuandong Li

A method for efficiently successive cancellation (SC) decoding of polar codes with high-dimensional linear binary kernels (HDLBK) is presented and analyzed. We devise a $l$-expressions method which can obtain simplified recursive formulas…

Information Theory · Computer Science 2017-01-18 Zhiliang Huang , Shiyi Zhang , Feiyan Zhang , Chunjiang Duanmu , Ming Chen

The successive cancellation list decoding algorithm for polar codes yields near-optimal decoding performance at the cost of high implementation complexity. The successive cancellation stack algorithm has been shown to provide similar…

Information Theory · Computer Science 2018-09-12 Harsh Aurora , Warren J. Gross

The growing demand for higher data rates necessitates continuous innovations in wireless communication systems, particularly with the emergence of 6G. Channel coding plays a crucial role in this evolution. In 5G systems, rate-adaptive…

In successive cancellation list (SCL) decoding, the tree pruning operation retains the L best paths with respect to metric at every decoding step. However, the correct path might be among the L worst paths due to imposed penalties. In this…

Information Theory · Computer Science 2020-01-30 Mohammad Rowshan , Emanuele Viterbo

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