English
Related papers

Related papers: Design of Irregular SC-LDPC Codes With Non-Uniform…

200 papers

The design of low-density parity-check (LDPC) code ensembles optimized for a finite number of decoder iterations is investigated. Our approach employs EXIT chart analysis and differential evolution to design such ensembles for the binary…

Information Theory · Computer Science 2016-11-17 Ian P. Mulholland , Enrico Paolini , Mark F. Flanagan

We propose a deterministic method to design irregular Low-Density Parity-Check (LDPC) codes for binary erasure channels (BEC). Compared to the existing methods, which are based on the application of asymptomatic analysis tools such as…

Information Theory · Computer Science 2008-01-24 Hamid Saeedi , Amir H. Banihashemi

Most existing works on analyzing the performance of a random ensemble of low-density parity-check (LDPC) codes assume that the degree distributions of the two ends of a randomly selected edge are independent. In the paper, we take one step…

Information Theory · Computer Science 2023-04-20 Hsiao-Wen Yu , Cheng-En Lee , Ruhui Zhang , Cheng-Shang Chang , Duan-Shin Lee

Spatially coupled low-density parity-check (SC-LDPC) codes are sparse graph codes that have recently become of interest due to their capacity-approaching performance on memoryless binary input channels. In this paper, we unify all existing…

Information Theory · Computer Science 2017-10-11 Allison Beemer , Salman Habib , Christine A. Kelley , Joerg Kliewer

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

Generalized low-density parity-check (GLDPC) codes are a class of LDPC codes in which the standard single parity check (SPC) constraints are replaced by constraints defined by a linear block code. These stronger constraints typically result…

Information Theory · Computer Science 2021-04-19 David G. M. Mitchell , Pablo M. Olmos , Michael Lentmaier , Daniel J. Costello

Spatially-coupled (SC) LDPC codes have recently emerged as an excellent choice for error correction in modern data storage and communication systems due to their outstanding performance. It has long been known that irregular graph codes…

Information Theory · Computer Science 2019-06-17 Homa Esfahanizadeh , Ruiyi Wu , Lara Dolecek

The complexity-performance trade-off is a fundamental aspect of the design of low-density parity-check (LDPC) codes. In this paper, we consider LDPC codes for the binary erasure channel (BEC), use code rate for performance metric, and…

Information Theory · Computer Science 2016-11-17 Vahid Jamali , Yasser Karimian , Johannes Huber , Mahmoud Ahmadian

The peeling decoding for spatially coupled low-density parity-check (SC-LDPC) codes is analyzed for a binary erasure channel. An analytical calculation of the mean evolution of degree-one check nodes of protograph-based SC-LDPC codes is…

Information Theory · Computer Science 2014-02-03 Markus Stinner Pablo M. Olmos

In this paper, we introduce a new practical and general method for solving the main problem of designing the capacity approaching, optimal rate, irregular low-density parity-check (LDPC) code ensemble over binary erasure channel (BEC).…

Information Theory · Computer Science 2016-11-18 H. Tavakoli , M. Ahmadian Attari , M. Reza Peyghami

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

Spatially-Coupled (SC)-LDPC codes are known to have outstanding error-correction performance and low decoding latency. Whereas previous works on LDPC and SC-LDPC codes mostly take either an asymptotic or a finite-length design approach, in…

Information Theory · Computer Science 2022-09-02 Homa Esfahanizadeh , Eshed Ram , Yuval Cassuto , Lara Dolecek

This paper investigates the design of spatially coupled low-density parity-check (SC-LDPC) codes constructed from connected-chain ensembles for bit-interleaved coded modulation (BICM) schemes. For short coupling lengths, connecting multiple…

Information Theory · Computer Science 2021-07-08 Yihuan Liao , Min Qiu , Jinhong Yuan

In this letter, we develop an efficient linear programming (LP) decoding algorithm for low-density parity-check (LDPC) codes. We first relax the maximum likelihood (ML) decoding problem to a LP problem by using check-node decomposition.…

Information Theory · Computer Science 2019-01-24 Jing Bai , Yongchao Wang , Francis C. M. Lau

We analyze the asymptotic performance of nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group, when the transmission takes place over the binary erasure channel. We propose an efficient…

Information Theory · Computer Science 2016-11-15 Amina Piemontese , Alexandre Graell i Amat , Giulio Colavolpe

In this paper, we deal with time-invariant spatially coupled low-density parity-check convolutional codes (SC-LDPC-CCs). Classic design approaches usually start from quasi-cyclic low-density parity-check (QC-LDPC) block codes and exploit…

Information Theory · Computer Science 2017-11-30 Massimo Battaglioni , Alireza Tasdighi , Giovanni Cancellieri , Franco Chiaraluce , Marco Baldi

In this paper, we present a novel way for solving the main problem of designing the capacity approaching irregular low-density parity-check (LDPC) code ensemble over binary erasure channel (BEC). The proposed method is much simpler, faster,…

Information Theory · Computer Science 2021-03-02 H. Tavakoli , M. Ahmadian Attari , M. R. Peyghami

Spatially coupled low-density parity-check (SC-LDPC) codes are a class of capacity approaching LDPC codes with low message recovery latency when a sliding window decoding is used. In this paper, we first present a new method for the…

Information Theory · Computer Science 2023-10-20 Zeinab Roostaie , Mohammad Gholami , Farzad Parvaresh

This paper presents a design technique for obtaining regular time-invariant low-density parity-check convolutional (RTI-LDPCC) codes with low complexity and good performance. We start from previous approaches which unwrap a low-density…

Information Theory · Computer Science 2016-11-17 Marco Baldi , Giovanni Cancellieri , Franco Chiaraluce

We present a new class of irregular low-density parity-check (LDPC) codes for moderate block lengths (up to a few thousand bits) that are well-suited for rate-compatible puncturing. The proposed codes show good performance under puncturing…

Information Theory · Computer Science 2016-11-18 Jaehong Kim , Aditya Ramamoorthy , Steven W. McLaughlin
‹ Prev 1 2 3 10 Next ›