Block-Markov LDPC scheme for half- and full-duplex erasure relay channel
Marina Ivashkina, Iryna Andriyanova, Pablo Piantanida, Charly Poulliat · 2011
The asymptotic iterative performance of the block-Markov encoding scheme, defined over bilayer LDPC codes, is analyzed. This analysis is carried out for both half-duplex and full-duplex regimes. For the sake of clarity and simplicity, a transmission over the binary erasure relay channel is assumed. To analyze the iterative performance of the coding scheme, the asymptotic threshold boundary γ (∈1, ∈2) is used as a performance measure. It is derived for two sparse-graph ensembles: Block-Markov Bilayer-Expurgated and -Lengthened LDPC ensembles.