English
Related papers

Related papers: AWGN Channel Analysis of Terminated LDPC Convoluti…

200 papers

Families of "asymptotically regular" LDPC block code ensembles can be formed by terminating (J,K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles…

Information Theory · Computer Science 2015-03-17 Michael Lentmaier , David G. M. Mitchell , Gerhard P. Fettweis , Daniel J. Costello,

In this paper, we present a method of constructing new families of LDPC block code ensembles formed by terminating irregular protograph-based LDPC convolutional codes. Using the accumulate-repeat-by-4-jagged-accumulate (AR4JA) protograph as…

Information Theory · Computer Science 2016-11-17 David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes. It has previously been shown that ensembles of…

Information Theory · Computer Science 2016-11-18 David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

In this paper we study the iterative decoding threshold performance of non-binary spatially-coupled low-density parity-check (NB-SC-LDPC) code ensembles for both the binary erasure channel (BEC) and the binary-input additive white Gaussian…

Information Theory · Computer Science 2016-11-18 Lai Wei , Toshiaki Koike-Akino , David G. M. Mitchell , Thomas E. Fuja , Daniel J. Costello

In this paper, we perform a threshold analysis of braided convolutional codes (BCCs) on the additive white Gaussian noise (AWGN) channel. The decoding thresholds are estimated by Monte-Carlo density evolution (MC-DE) techniques and compared…

Information Theory · Computer Science 2018-03-01 Muhammad Umar Farooq , Saeedeh Moloudi , Michael Lentmaier

An ensemble of LDPC convolutional codes with parity-check matrices composed of permutation matrices is considered. The convergence of the iterative belief propagation based decoder for terminated convolutional codes in the ensemble is…

Information Theory · Computer Science 2016-11-17 Michael Lentmaier , Arvind Sridharan , Kamil Sh. Zigangirov , Daniel J. Costello

Protograph low-density-parity-check (LDPC) are considered to design near-capacity low-rate codes over the binary erasure channel (BEC) and binary additive white Gaussian noise (BIAWGN) channel. For protographs with degree-one variable nodes…

Information Theory · Computer Science 2018-05-03 Asit Kumar Pradhan , Andrew Thangaraj

Ensembles of (J,K)-regular low-density parity-check convolutional (LDPCC) codes are known to be asymptotically good, in the sense that the minimum free distance grows linearly with the constraint length. In this paper, we use a…

Information Theory · Computer Science 2016-11-15 David G. M. Mitchell , Ali E. Pusane , Michael Lentmaier , Daniel J. Costello

In this paper, we study the density evolution analysis of spatially coupled low-density parity-check (SC-LDPC) codes over binary input additive white Gaussian noise (BIAWGN) channels under the belief propagation (BP) decoding algorithm.…

Information Theory · Computer Science 2015-10-19 Md. Noor-A-Rahim , Gottfried Lechner , Khoa D. Nguyen

The protograph low-density parity-check (LDPC) codes possess many attractive properties, such as the low encoding/decoding complexity and better error floor performance, and hence have been successfully applied to different types of…

Information Theory · Computer Science 2019-05-01 Xingwei Zhong , Kui Cai , Pingping Chen , Zhen Mei

In this paper, we construct protograph-based spatially coupled low-density parity-check (SC-LDPC) codes by coupling together a series of L disjoint, or uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying L, we obtain…

Information Theory · Computer Science 2016-11-17 David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

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

We propose a technique to design finite-length irregular low-density parity-check (LDPC) codes over the binary-input additive white Gaussian noise (AWGN) channel with good performance in both the waterfall and the error floor region. The…

Information Theory · Computer Science 2016-11-17 Reza Asvadi , Amir H. Banihashemi , Mahmoud Ahmadian-Attari

Families of "asymptotically regular" LDPC block code ensembles can be formed by terminating (J,K)-regular protograph-based LDPC convolutional codes. By varying the termination length, we obtain a large selection of LDPC block code ensembles…

Information Theory · Computer Science 2016-11-15 David G. M. Mitchell , Roxana Smarandache , Michael Lentmaier , Daniel J. Costello

CC-GLPDC codes are a class of generalized low-density parity-check (GLDPC) codes where the constraint nodes (CNs) represent convolutional codes. This allows for efficient decoding in the trellis with the forward-backward algorithm, and the…

Information Theory · Computer Science 2022-12-01 Muhammad Umar Farooq , Michael Lentmaier , Alexandre Graell i Amat

Density evolution for protograph Low-Density Parity-Check (LDPC) codes is considered, and it is shown that the message-error rate falls double-exponentially with iterations whenever the degree-2 subgraph of the protograph is cycle-free and…

Information Theory · Computer Science 2016-11-18 Asit Kumar Pradhan , Andrew Thangaraj , Arunkumar Subramanian

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

Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) have been shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this spectacular…

Information Theory · Computer Science 2015-03-20 Arvind Yedla , Yung-Yih Jian , Phong S. Nguyen , Henry D. Pfister

A novel code construction based on spatially coupled low-density parity-check (SC-LDPC) codes is presented. The proposed code ensembles are described by protographs, comprised of several protograph-based chains characterizing individual…

Information Theory · Computer Science 2016-11-18 Dmitri Truhachev , David G. M. Mitchell , Michael Lentmaier , Daniel J. Costello

Low-density parity-check (LDPC) convolutional codes (or spatially-coupled codes) were recently shown to approach capacity on the binary erasure channel (BEC) and binary-input memoryless symmetric channels. The mechanism behind this…

Information Theory · Computer Science 2016-11-17 Arvind Yedla , Yung-Yih Jian , Phong S. Nguyen , Henry D. Pfister
‹ Prev 1 2 3 10 Next ›