English
Related papers

Related papers: Error Floor Analysis of LDPC Column Layered Decode…

200 papers

Protograph-based low-density parity-check Hadamard codes (PLDPC-HCs) are a new type of ultimate-Shannon-limit-approaching codes. In this paper, we propose a hardware architecture for the PLDPC-HC layered decoders. The decoders consist…

Information Theory · Computer Science 2022-08-22 Peng W. Zhang , Francis C. M. Lau , Chiu-W. Sham

LDPC codes are used in many applications, however, their error correcting capabilities are limited by the presence of stopping sets and trapping sets. Trapping sets and stopping sets occur when specific low-wiehgt error patterns cause a…

Information Theory · Computer Science 2017-05-18 Aiden Price , Joanne Hall

We analyze the finite-length performance of spatially coupled low-density parity-check (SC-LDPC) codes under window decoding over the binary erasure channel. In particular, we propose a refinement of the scaling law by Olmos and Urbanke for…

Information Theory · Computer Science 2020-08-26 Roman Sokolovskii , Alexandre Graell i Amat , Fredrik Brännström

We propose a new low-density parity-check code construction scheme based on 2-lifts. The proposed codes have an advantage of admitting efficient hardware implementations. With the motivation of designing codes with low error floors, we…

Information Theory · Computer Science 2009-08-27 Xudong Ma , En-hui Yang

Recently, we introduced a new class of finite alphabet iterative decoders (FAIDs) for low-density parity-check (LDPC) codes. These decoders are capable of surpassing belief propagation in the error floor region on the Binary Symmetric…

Information Theory · Computer Science 2016-11-17 David Declercq , Bane Vasic , Shiva Kumar Planjery , Erbao Li

In this paper, a simple, general-purpose and effective tool for the design of low-density parity-check (LDPC) codes for iterative correction of bursts of erasures is presented. The design method consists in starting from the parity-check…

Information Theory · Computer Science 2008-10-08 E. Paolini , M. Chiani

This paper proposes a "quasi-synchronous" design approach for signal processing circuits, in which timing violations are permitted, but without the need for a hardware compensation mechanism. The case of a low-density parity-check (LDPC)…

Information Theory · Computer Science 2017-11-21 François Leduc-Primeau , Frank R. Kschischang , Warren J. Gross

In this paper we construct low-density parity-check (LDPC) codes from transversal designs with low error-floors over the additive white Gaussian noise (AWGN) channel. The constructed codes are based on transversal designs that arise from…

Information Theory · Computer Science 2014-03-20 Alexander Gruner , Michael Huber

This study focuses on the efficiency of message-passing-based decoding algorithms for polar and low-density parity-check (LDPC) codes. Both successive cancellation (SC) and belief propagation (BP) decoding algorithms are studied {in} the…

Information Theory · Computer Science 2023-04-24 Dawei Yin , Yuan Li , Xianbin Wang , Jiajie Tong , Huazi Zhang , Jun Wang , Guanghui Wang , Jun Chen , Guiying Yan , Zhiming Ma , Wen Tong

We consider spatially coupled low-density parity-check (SC-LDPC) codes within a non-orthogonal interleave division multiple access (IDMA) scheme to avoid cumbersome degree profile matching of the LDPC code components to the iterative…

Information Theory · Computer Science 2019-01-29 Sebastian Cammerer , Xiaojie Wang , Yingyan Ma , Stephan ten Brink

In this paper, we introduce an efficient iterative solver for the joint linear-programming (LP) decoding of low-density parity-check (LDPC) codes and finite-state channels (FSCs). In particular, we extend the approach of iterative…

Information Theory · Computer Science 2016-11-17 Byung-Hak Kim , Henry D. Pfister

Assuming iterative decoding for binary erasure channels (BECs), a novel tree-based technique for upper bounding the bit error rates (BERs) of arbitrary, finite low-density parity-check (LDPC) codes is provided and the resulting bound can be…

Information Theory · Computer Science 2007-07-13 Chih-Chun Wang , Sanjeev R. Kulkarni , H. Vincent Poor

In this paper, we propose a new design method of irregular spatially-coupled low-density parity-check (SC-LDPC) codes with non-uniform degree distributions by linear programming (LP). In general, irregular SC-LDPC codes with non-uniform…

Information Theory · Computer Science 2018-03-28 Heeyoul Kwak , Jong-Seon No , Hosung Park

Spatially coupled turbo-like codes (SC-TCs) have been shown to have excellent decoding thresholds due to the threshold saturation effect. Furthermore, even for moderate block lengths, simulation results demonstrate very good bit error rate…

Information Theory · Computer Science 2018-04-06 Saeedeh Moloudi , Michael Lentmaier , Alexandre Graell i Amat

In this paper, we report an encoding and decoding method for irregular-quasic-cyclic low-density parity-check (IR-QC-LDPC) codes with multi rates. The algorithm is applicable to parity-check matrices which have dual-diagonal parity…

Information Theory · Computer Science 2019-10-31 Kun Cheng , Qiming Lu , Hongbo Xie , Qi Shen , Shengkai Liao , Chengzhi Peng

In this paper, we propose a new approach to construct a class of check-hybrid generalized low-density parity-check (CH-GLDPC) codes which are free of small trapping sets. The approach is based on converting some selected check nodes…

Information Theory · Computer Science 2016-04-19 Vida Ravanmehr , Mehrdad Khatami , David Declercq , Bane Vasic

With the use of belief propagation (BP) decoding algorithm, low-density parity-check (LDPC) codes can achieve near-Shannon limit performance. In order to evaluate the error performance of LDPC codes, simulators running on CPUs are commonly…

Information Theory · Computer Science 2012-07-30 Yue Zhao , Francis C. M. Lau

We consider the effect of LLR saturation on belief propagation decoding of low-density parity-check codes. Saturation occurs universally in practice and is known to have a significant effect on error floor performance. Our focus is on…

Information Theory · Computer Science 2014-03-17 Shrinivas Kudekar , Tom Richardson , Aravind Iyengar

Spatially-coupled low-density parity-check (LDPC) codes, which were first introduced as LDPC convolutional codes, have been shown to exhibit excellent performance under low-complexity belief-propagation decoding. This phenomenon is now…

Information Theory · Computer Science 2015-01-16 Santhosh Kumar , Andrew J. Young , Nicolas Macris , Henry D. Pfister

Decoder diversity is a powerful error correction framework in which a collection of decoders collaboratively correct a set of error patterns otherwise uncorrectable by any individual decoder. In this paper, we propose a new approach to…

Information Theory · Computer Science 2021-05-11 Xin Xiao , Nithin Raveendran , Bane Vasic , Shu Lin , Ravi Tandon