The asymptotic iterative performance of the blockMarkov 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: BlockMarkov Bilayer-Expurgated and -Lengthened LDPC ensembles.
International audienceIn this paper, the asymptotic iterative performance of block-Markov, sparse-graph codes over the binary erasure relay channel is investigated. Note that the full-duplex relay channel is a particular case of the considered model. We obtain two interesting results: a) the block-Markov structure does not improve the asymptotic performance of good erasure-correcting sparse-graph codes; b) under certain conditions, it does however improve the asymptotic performance of good erasure-detecting (i.e. bad erasure-correcting) sparse-graph codes
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.