English
Related papers

Related papers: Hardware-friendly IR-HARQ for Polar SCL Decoders

200 papers

This paper presents a novel type-II hybrid automatic repeat request (HARQ) transmission scheme which is based on pruned convolutional codes (CCs) and supports unequal error protection (UEP). The data to be transmitted is assumed to consist…

Information Theory · Computer Science 2015-09-30 Annabel Sharon Shitrit , Yonathan Murin , Ron Dabora , Osnat Keren

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 asymptotically achieve the symmetric capacity of memoryless channels, yet their error-correcting performance under successive-cancellation (SC) decoding for short and moderate length codes is worse than that of other modern…

Information Theory · Computer Science 2015-12-25 Gabi Sarkis , Pascal Giard , Alexander Vardy , Claude Thibeault , Warren J. Gross

Cyclic redundancy check (CRC) aided polar codes are capable of achieving better performance than low-density parity-check (LDPC) codes under the successive cancelation list (SCL) decoding scheme. However, the SCL decoding scheme suffers…

Information Theory · Computer Science 2016-09-29 Mao-Ching Chiu , Wei-De Wu

Successive cancellation list (SCL) decoding algorithm is a powerful method that can help polar codes achieve excellent error-correcting performance. However, the current SCL algorithm and decoders are based on likelihood or log-likelihood…

Information Theory · Computer Science 2014-12-16 Bo Yuan , Keshab K. Parhi

Long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels under a low complexity successive cancelation (SC) decoding algorithm. But for polar codes with short and moderate code length, the decoding…

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

Row-merged polar codes are a family of pre-transformed polar codes (PTPCs) with little precoding overhead. Providing an improved distance spectrum over plain polar codes, they are capable to perform close to the finite-length capacity…

Information Theory · Computer Science 2023-12-25 Andreas Zunker , Marvin Geiselhart , Lucas Johannsen , Claus Kestel , Stephan ten Brink , Timo Vogt , Norbert Wehn

Under successive cancellation (SC) decoding, polar codes are inferior to other codes of similar blocklength in terms of frame error rate. While more sophisticated decoding algorithms such as list- or stack-decoding partially mitigate this…

Information Theory · Computer Science 2014-12-18 Orion Afisiadis , Alexios Balatsoukas-Stimming , Andreas Burg

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

Due to their capacity-achieving property, polar codes have become one of the most attractive channel codes. To date, the successive cancellation list (SCL) decoding algorithm is the primary approach that can guarantee outstanding…

Information Theory · Computer Science 2016-11-18 Bo Yuan , Keshab K. Parhi

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

Polar codes are the first codes with a proven capacity-achieving capability, but their decoding faces several challenges, especially under long code lengths. In this paper, we target algorithmic improvements and analyses to enable the…

Information Theory · Computer Science 2026-05-22 Jiajie Li , Sihui Shen , Warren J. Gross

As the first error correction codes provably achieving the symmetric capacity of binary-input discrete memory-less channels (B-DMCs), polar codes have been recently chosen by 3GPP for eMBB control channel. Among existing algorithms,…

Signal Processing · Electrical Eng. & Systems 2018-03-19 Huayi Zhou , Xiao Liang , Liping Li , Zaichen Zhang , Xiaohu You , Chuan Zhang

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

Polar codes represent one of the major recent breakthroughs in coding theory and, because of their attractive features, they have been selected for the incoming 5G standard. As such, a lot of attention has been devoted to the development of…

Information Theory · Computer Science 2017-08-31 Seyyed Ali Hashemi , Marco Mondelli , S. Hamed Hassani , Rudiger Urbanke , Warren J. Gross

Due to the sequential nature of the successive-cancellation (SC) algorithm, the decoding of polar codes suffers from significant decoding latencies. Fast SC decoding is able to speed up the SC decoding process, by implementing parallel…

Information Theory · Computer Science 2022-11-21 Yang Lu , Ming-Min Zhao , Ming Lei , Min-Jian Zhao

Polar codes have attracted much attention in the past decade due to their capacity-achieving performance. The higher decoding capacity is required for 5G and beyond 5G (B5G). Although the cyclic redundancy check (CRC)- assisted successive…

Signal Processing · Electrical Eng. & Systems 2019-12-12 Chun-Hsiang Chen , Chieh-Fang Teng , An-Yeu Wu

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 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

This letter concerns the power allocation across the multiple transmission rounds under the Incremental Redundancy Hybrid Automatic Repeat reQuest (IR-HARQ) policy, in pursuit of an energy-efficient way of fulfilling the outage probability…

Information Theory · Computer Science 2024-09-20 Wenyu Wang , Minhao Zhu , Kaiming Shen , Zhaorui Wang , Shuguang Cui