Computer Science – Information Theory
Scientific paper
2010-05-06
Computer Science
Information Theory
To be presented at the 2010 IEEE International Symposium on Information Theory
Scientific paper
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 an example, a density evolution analysis for the binary erasure channel shows that this flexible design technique gives rise to a large selection of LDPC block code ensembles with varying code rates and thresholds close to capacity. Further, by means of an asymptotic weight enumerator analysis, we show that all the ensembles in this family also have minimum distance that grows linearly with block length, i.e., they are asymptotically good.
Costello Daniel J. Jr.
Lentmaier Michael
Mitchell David G. M.
No associations
LandOfFree
New Families of LDPC Block Codes Formed by Terminating Irregular Protograph-Based LDPC Convolutional Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with New Families of LDPC Block Codes Formed by Terminating Irregular Protograph-Based LDPC Convolutional Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Families of LDPC Block Codes Formed by Terminating Irregular Protograph-Based LDPC Convolutional Codes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-26826