Block-MarkovLDPCSchemeforHalf-andFull-Duplex-Etis.PDFVIP

Block-Markov LDPC Scheme for Half- and Full-Duplex Erasure Relay Channel Marina Ivashkina Iryna Andriyanova Pablo Piantanida Charly Poulliat ETIS group ETIS group Dept. of Telecoms ETIS group ENSEA/UCP/CNRS-UMR8051 ENSEA/UCP/CNRS-UMR8051 SUPELEC ENSEA/UCP/CNRS-UMR8051 Cergy-Pontoise, France Cergy-Pontoise, France Gif-sur-Yvette, France Cergy-Pontoise, France marina.ivashkina@ensea.fr iryna.andriyanova@ensea.fr pablo.piantanida@supelec.fr poulliat@ensea.fr Abstract—The asymptotic iterative performance of the block- that will be seen by the destination. The structure of one block Markov encoding scheme, defined over bilayer LDPC codes, is of the block-Markov coding scheme represents a practical analyzed. This analysis is carried out for both half-duplex and implementation of random coding scheme and can be viewed full-duplex regimes. For the sake of clarity and simplicity, a transmission over the binary erasure relay channel is assumed. as a generalized bilayer structure. Assuming sparse-graph To analyze the iterative performance of the coding scheme, the codes (in particular, bilayer LDPC codes), we investigate asymptotic threshold boundary is used as a performance the asymptotic performance of the block-Markov scheme via measure. It is derived for two sparse-graph ensembles: Block- density evolution. For the sake of simplicity, through this Markov Bilayer-Expurgated and -Lengthened LDPC ensembles. paper we consider only the binary erasure relay channel (BE- RC). However, the presented scheme and its analysis can