Density evolution analysis of Protograph-based braided block codes on the erasure channel

A threshold analysis of terminated braided block codes (BBCs) is presented for the binary erasure channel. Protograph based BBCs (PG-BBCs) are considered, which can be derived by lifting the Tanner graph of a tightly braided block code. They can be interpreted as GLDPC convolutional codes that are structured in a particular way. It is shown that the terminated PG-BBCs have better thresholds than their GLDPC block code counterparts. Simulation results are presented to confirm the computed asymptotic thresholds.