English
Related papers

Related papers: Parallelism versus Latency in Simplified Successiv…

200 papers

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

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

Polar codes are the first class of structured channel codes that achieve the symmetric capacity of binary channels with efficient encoding and decoding. In 2019, Arikan proposed a new polar coding scheme referred to as polarization-adjusted…

Information Theory · Computer Science 2024-01-30 Hamid Saber , Homayoon Hatami , Jung Hyun Bae

We consider practical hardware implementation of Polar decoders. To reduce latency due to the serial nature of successive cancellation (SC), existing optimizations improve parallelism with two approaches, i.e., multi-bit decision or reduced…

Information Theory · Computer Science 2018-08-07 Huazi Zhang , Jiajie Tong , Rong Li , Pengcheng Qiu , Yourui Huangfu , Chen Xu , Xianbin Wang , Jun Wang

This paper presents an efficient hardware design approach for list successive cancellation (LSC) decoding of polar codes. By applying path-overlapping scheme, the l instances of (l > 1) successive cancellation (SC) decoder for LSC with list…

Information Theory · Computer Science 2015-11-03 Tiben Che , Jingwei Xu , Gwan Choi

Polar codes are widely considered as one of the most exciting recent discoveries in channel coding. For short to moderate block lengths, their error-correction performance under list decoding can outperform that of other modern…

Signal Processing · Electrical Eng. & Systems 2018-06-06 Pascal Giard , Andreas Burg

Channel polarization and Polar code are widely considered as major breakthroughs in coding theory because they have shown promising features for future wireless standards. The main drawbacks of Polar code are high-latency in decoding…

Signal Processing · Electrical Eng. & Systems 2019-05-14 Duc-Phuc Nguyen , Dinh-Dung Le , Thi-Hong Tran , Takashi Nakada , Yasuhiko Nakashima

Polar codes are a class of channel capacity achieving codes that has been selected for the next generation of wireless communication standards. Successive-cancellation (SC) is the first proposed decoding algorithm, suffering from mediocre…

Information Theory · Computer Science 2018-10-09 Furkan Ercan , Carlo Condo , Seyyed Ali Hashemi , Warren J. Gross

A two-part successive syndrome-check decoding of polar codes is proposed with the first part successively refining the received codeword and the second part checking its syndrome. A new formulation of the successive-cancellation (SC)…

Information Theory · Computer Science 2021-12-02 Seyyed Ali Hashemi , Marco Mondelli , John Cioffi , Andrea Goldsmith

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 codes are the first provable capacity-achieving forward error correction (FEC) codes. In general polar codes can be decoded via either successive cancellation (SC) or belief propagation (BP) decoding algorithm. However, to date…

Information Theory · Computer Science 2014-11-27 Bo Yuan , Keshab K. Parhi

Polar codes are of great interests because they provably achieve the capacity of both discrete and continuous memoryless channels while having an explicit construction. Most existing decoding algorithms of polar codes are based on bit-wise…

Information Theory · Computer Science 2016-01-20 Chenrong Xiong , Jun Lin , Zhiyuan Yan

Even though polar codes were adopted in the latest 5G cellular standard, they still have the fundamental problem of high decoding latency. Aiming at solving this problem, a fast simplified successive cancellation (Fast-SSC) decoder based on…

Information Theory · Computer Science 2020-08-20 Haotian Zheng , Alexios Balatsoukas-Stimming , Zizheng Cao , Ton Koonen

Polar codes are linear block codes that can achieve channel capacity at infinite code length. Successive cancellation list (SCL) decoding relies on a set of parallel decoders; it yields good error-correction performance at finite code…

Information Theory · Computer Science 2021-01-12 Carlo Condo

The recently proposed SCLF decoding algorithm for polar codes improves the error-correcting performance of state-of-the-art SCL decoding. However, it comes at the cost of a higher complexity. In this paper, partitioned polar codes tailored…

Information Theory · Computer Science 2026-05-12 Charles Pillet , Ilshat Sagitov , Pascal Giard

Polar codes achieve outstanding error correction performance when using successive cancellation list (SCL) decoding with cyclic redundancy check. A larger list size brings better decoding performance and is essential for practical…

Signal Processing · Electrical Eng. & Systems 2019-05-03 ChenYang Xia , YouZhe Fan , Chi-Ying Tsui

This work presents an efficient ASIC implementation of successive cancellation (SC) decoder for polar codes. SC is a low-complexity depth-first search decoding algorithm, favorable for beyond-5G applications that require extremely high…

Hardware Architecture · Computer Science 2020-09-22 Altuğ Süral , E. Göksu Sezer , Ertuğrul Kolağasıoğlu , Veerle Derudder , Kaoutar Bertrand

Due to the low-latency and high-reliability requirements of 5G, low-complexity node-based successive cancellation list (SCL) decoding has received considerable attention for use in 5G communications systems. By identifying special…

Information Theory · Computer Science 2022-12-21 Yuqing Ren , Andreas Toftegaard Kristensen , Yifei Shen , Alexios Balatsoukas-Stimming , Chuan Zhang , Andreas Burg

The decoding performance of polar codes strongly depends on the decoding algorithm used, while also the decoder throughput and its latency mainly depend on the decoding algorithm. In this work, we implement the powerful successive…

Information Theory · Computer Science 2016-12-22 Sebastian Cammerer , Benedikt Leible , Matthias Stahl , Jakob Hoydis , Stephan ten Brink

This work presents a fast successive-cancellation list flip (Fast-SCLF) decoding algorithm for polar codes that addresses the high latency issue associated with the successive-cancellation list flip (SCLF) decoding algorithm. We first…

Information Theory · Computer Science 2022-01-25 Nghia Doan , Seyyed Ali Hashemi , Warren J. Gross