DocumentCode :
2944812
Title :
LDPC Coding For The Three-Terminal Erasure Relay Channel
Author :
Sridhara, Deepak ; Kelley, Christine A.
Author_Institution :
Institut fur Mathematik, Zurich Univ.
fYear :
2006
fDate :
9-14 July 2006
Firstpage :
1229
Lastpage :
1233
Abstract :
A three terminal erasure relay channel is considered. It has been shown that appropriately designed maximum distance separable codes achieve the cut-set upper bound on capacity of the three terminal erasure relay channel. This paper presents low-density parity-check (LDPC) coding alternatives for this channel. Design rules for constructing LDPC codes that perform close to the cut-set upper bound on capacity are provided for the general erasure relay channel and also the degraded erasure relay channel, wherein all the information available at the receiver are also available at the relay
Keywords :
channel coding; parity check codes; LDPC coding; cut-set upper bound; low-density parity-check coding; receiver; three-terminal erasure relay channel; Communication channels; Degradation; Interference; Mathematics; Parity check codes; Probability density function; Protective relaying; Protocols; Relays; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2006 IEEE International Symposium on
Conference_Location :
Seattle, WA
Print_ISBN :
1-4244-0505-X
Electronic_ISBN :
1-4244-0504-1
Type :
conf
DOI :
10.1109/ISIT.2006.262001
Filename :
4036161
Link To Document :
بازگشت