DocumentCode
2944845
Title
Half-Duplex Estimate-and-Forward Relaying: Bounds and Code Design
Author
Chakrabarti, Arnab ; de Baynast, A. ; Sabharwal, Ashutosh ; Aazhang, Behnaam
Author_Institution
Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX
fYear
2006
fDate
9-14 July 2006
Firstpage
1239
Lastpage
1243
Abstract
We propose a practical coding scheme for half-duplex estimate-and-forward relaying. The proposed construction is guided by the information theoretic coding scheme for the estimate-and-forward relay protocol. Our construction incorporates several design features to reduce receiver complexity without compromising performance. Observing that the relaying gain is significant only at low SNRs, we use binary LDPC codes in the source broadcast phase of relaying. Estimation is performed by entropy constrained scalar quantization of the received signal at the relay. Finally, a procedure similar to maximal ratio combining is used to aggregate direct and relayed signals at the destination. An important practical advantage of our scheme is that it does not require source-relay symbol synchronization. The codes outperform direct and two-hop channel capacities, as well as decode-and-forward relaying when the relay-destination link is strong
Keywords
binary codes; channel capacity; channel coding; computational complexity; parity check codes; SNR; binary LDPC codes; code design; entropy constrained scalar quantization; half-duplex estimate-and-forward relaying; information theoretic coding scheme; receiver complexity; relay-destination link; source broadcast phase; two-hop channel capacity; Aggregates; Broadcasting; Channel capacity; Decoding; Diversity reception; Entropy; Parity check codes; Protocols; Quantization; Relays;
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.262003
Filename
4036163
Link To Document