Detailedly represented irregular low-density parity-check codes
Richardson and Urbanke developed a powerful method density evolution which determines, for various channels; the capacity of irregular low-density parity-check code ensembles. We develop generalized density evolution for minutely represented ensembles and show it includes conventional representation as a special case. Furthermore, we present an example of code ensembles used over binary erasure channel and binary input. additive white Gaussian noise channel which have better thresholds than highly optimized ensembles with conventional representation.
irregular low-density parity-check codes low-density parity-check codes density evolution belief propagation