Block-Markov LDPC scheme for half- and full-duplex erasure relay channel

Author

Ivashkina, Marina ; Andriyanova, Iryna ; Piantanida, Pablo ; Poulliat, Charly

Author_Institution

ETIS Group, UCP, Cergy-Pontoise, France

fYear

2011

fDate

July 31 2011-Aug. 5 2011

Firstpage

1469

Lastpage

1473

Abstract

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 γ (∈₁, ∈₂) is used as a performance measure. It is derived for two sparse-graph ensembles: Block-Markov Bilayer-Expurgated and -Lengthened LDPC ensembles.

Keywords

Markov processes; binary codes; block codes; channel coding; decode and forward communication; iterative decoding; iterative methods; network coding; parity check codes; relays; asymptotic iterative performance; asymptotic threshold boundary; bilayer LDPC code; binary erasure relay channel; block-Markov DF scheme; block-Markov bilayer-expurgated LDPC ensemble scheme; block-Markov bilayer-lengthened LDPC ensemble scheme; block-Markov decode-and-forward scheme; full-duplex erasure relay channel; half-duplex erasure relay channel; sparse-graph ensemble; Channel models; Encoding; Equations; Markov processes; Parity check codes; Protocols; Relays;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on

Conference_Location

St. Petersburg

ISSN

2157-8095

Print_ISBN

978-1-4577-0596-0

Electronic_ISBN

2157-8095

Type

conf

DOI

10.1109/ISIT.2011.6033785

Filename

6033785