On the Minimum Distance of Generalized Spatially Coupled LDPC Codes

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 GSC-LDPC codes constructed from a protograph have better iterative decoding thresholds than their block code counterparts, and that, for large termination lengths, their thresholds coincide with the Maximum A-Posteriori (MAP) decoding threshold of the underlying generalized LDPC block code ensemble. Here, the authors show that, in addition to their excellent iterative decoding thresholds, ensembles of GSC-LDPC codes are asymptotically good and have large minimum distance growth rates.

Provided by: University of Northern Iowa Topic: Networking Date Added: Mar 2013 Format: PDF

Find By Topic