English
Related papers

Related papers: Long Polar vs. LDPC Codes under Complexity-Constra…

200 papers

Nowadays polar codes are becoming one of the most favorable capacity achieving error correction codes for their low encoding and decoding complexity. However, due to the large code length required by practical applications, the few existing…

Hardware Architecture · Computer Science 2011-11-04 Chuan Zhang , Bo Yuan , Keshab K. Parhi

In this paper, we design and compare multilevel polar coding (MLPC) and bit-interleaved polar coded modulation (BIPCM) for uplink sparse code multiple access (SCMA) systems that operate over fast and block fading channels. Both successive…

Information Theory · Computer Science 2017-07-05 Monirosharieh Vameghestahbanati , Ian Marsland , Ramy H. Gohary , Halim Yanikomeroglu

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

Low-density parity-check (LDPC) codes are specified by graphs, and are the error correction technique of choice in many communications and data storage contexts. Message passing decoders diffuse information carried by parity bits into the…

Information Theory · Computer Science 2023-05-02 Beyza Dabak , Ece Tiryaki , Robert Calderbank , Ahmed Hareedy

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

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

This paper focuses on low complexity successive cancellation list (SCL) decoding of polar codes. In particular, using the fact that splitting may be unnecessary when the reliability of decoding the unfrozen bit is sufficiently high, a novel…

Information Theory · Computer Science 2016-11-17 Zhaoyang Zhang , Liang Zhang , Xianbin Wang , Caijun Zhong , H. Vincent Poor

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

Non-binary linear block codes (NB-LBCs) are an important class of error-correcting codes that are especially competent in correcting burst errors. They have broad applications in modern communications and storage systems. However, efficient…

Information Theory · Computer Science 2026-01-21 Jingyu Lin , Li Chen , Xiaoqian Ye

Successive-cancellation list (SCL) decoding is an algorithm that provides very good error-correction performance for polar codes. However, its hardware implementation requires a large amount of memory, mainly to store intermediate results.…

Hardware Architecture · Computer Science 2017-03-28 Seyyed Ali Hashemi , Alexios Balatsoukas-Stimming , Pascal Giard , Claude Thibeault , Warren J. Gross

Linear Programming (LP) decoding of Low-Density Parity-Check (LDPC) codes has attracted much attention in the research community in the past few years. LP decoding has been derived for binary and nonbinary linear codes. However, the most…

Information Theory · Computer Science 2016-11-17 Mayur Punekar , Pascal O. Vontobel , Mark F. Flanagan

Due to their provably capacity-achieving performance, polar codes have attracted a lot of research interest recently. For a good error-correcting performance, list successive-cancellation decoding (LSCD) with large list size is used to…

Information Theory · Computer Science 2018-07-02 YouZhe Fan , ChenYang Xia , Ji Chen , Chi-Ying Tsui , Jie Jin , Hui Shen , Bin Li

Polar codes are the first class of forward error correction (FEC) codes with a provably capacity-achieving capability. Using list successive cancellation decoding (LSCD) with a large list size, the error correction performance of polar…

Signal Processing · Electrical Eng. & Systems 2018-05-09 ChenYang Xia , YouZhe Fan , Ji Chen , Chi-ying Tsui , ChongYang Zeng , Jie Jin , Bin Li

We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather…

Information Theory · Computer Science 2016-11-18 Joseph J. Boutros , Albert Guillen i Fabregas , Ezio Biglieri , Gilles Zemor

Polar codes under cyclic redundancy check aided successive cancellation list (CA-SCL) decoding can outperform the turbo codes and the LDPC codes when code lengths are configured to be several kilobits. In order to reduce the decoding…

Information Theory · Computer Science 2015-08-11 Kai Chen , Bin Li , Hui Shen , Jie Jin , David Tse

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

A new type of spatially coupled low-density parity-check (SC-LDPC) codes motivated by practical storage applications is presented. SC-LDPCL codes (suffix 'L' stands for locality) can be decoded locally at the level of sub-blocks that are…

Information Theory · Computer Science 2020-09-29 Eshed Ram , Yuval Cassuto

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

In this paper, a new method for decoding Low Density Parity Check (LDPC) codes, based on Multi-Layer Perceptron (MLP) neural networks is proposed. Due to the fact that in neural networks all procedures are processed in parallel, this method…

Information Theory · Computer Science 2014-11-14 Alireza Karami , Mahmoud Ahmadian Attari

Polar codes were introduced in 2009 and proven to achieve the symmetric capacity of any binary-input discrete memoryless channel under low-complexity successive cancellation decoding. In this thesis, we construct cyclic polar codes based on…

Information Theory · Computer Science 2020-04-16 Narayanan Rengaswamy