Ergodic Rates of the Fast Rayleigh Fading Relay Channel for Different Cooperative Strategies
Rizinski, Maryan; Kafedziski, Venceslav
Serdica Journal of Computing (2013)
- Volume: 7, Issue: 2, page 101-114
- ISSN: 1312-6555
Access Full Article
topAbstract
topHow to cite
topRizinski, Maryan, and Kafedziski, Venceslav. "Ergodic Rates of the Fast Rayleigh Fading Relay Channel for Different Cooperative Strategies." Serdica Journal of Computing 7.2 (2013): 101-114. <http://eudml.org/doc/268664>.
@article{Rizinski2013,
abstract = {ACM Computing Classification System (1998): E.4, C.2.1.This paper investigates the ergodic rates of three cooperative strategies for the fast Rayleigh fading relay channel, namely, decode-andforward (DF), compress-and-forward (CF) and amplify-and-forward (AF). The transmitter-relay, relay-receiver and transmitter-receiver links experience independent fast Rayleigh fading. Our analysis considers both fullduplex and half-duplex modes of operation of the relay channel, assuming that perfect transmit channel distribution information (CDI) is available at the transmitter and the relay. The ergodic rates are compared under different channel conditions to the corresponding upper capacity bounds of the relay channel and to the rate of direct transmission in order to investigate when it is beneficial to use a certain cooperative strategy. Cooperative transmission makes the ergodic rates approach or even become identical to the upper capacity bounds if some conditions are satisfied. The results show that DF and CF outperform AF as they are more complex strategies, while AF itself achieves higher rates than direct transmission in most channel scenarios, thus trading performance for implementation simplicity.},
author = {Rizinski, Maryan, Kafedziski, Venceslav},
journal = {Serdica Journal of Computing},
keywords = {Gaussian Relay Channel`; Fast Rayleigh Fading; Channel Capacity; Ergodic Rates; Cooperative Strategies; Amplify-and-Forward; Decode-and-Forward; Compress-and-Forward; Wireless Networks},
language = {eng},
number = {2},
pages = {101-114},
publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},
title = {Ergodic Rates of the Fast Rayleigh Fading Relay Channel for Different Cooperative Strategies},
url = {http://eudml.org/doc/268664},
volume = {7},
year = {2013},
}
TY - JOUR
AU - Rizinski, Maryan
AU - Kafedziski, Venceslav
TI - Ergodic Rates of the Fast Rayleigh Fading Relay Channel for Different Cooperative Strategies
JO - Serdica Journal of Computing
PY - 2013
PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences
VL - 7
IS - 2
SP - 101
EP - 114
AB - ACM Computing Classification System (1998): E.4, C.2.1.This paper investigates the ergodic rates of three cooperative strategies for the fast Rayleigh fading relay channel, namely, decode-andforward (DF), compress-and-forward (CF) and amplify-and-forward (AF). The transmitter-relay, relay-receiver and transmitter-receiver links experience independent fast Rayleigh fading. Our analysis considers both fullduplex and half-duplex modes of operation of the relay channel, assuming that perfect transmit channel distribution information (CDI) is available at the transmitter and the relay. The ergodic rates are compared under different channel conditions to the corresponding upper capacity bounds of the relay channel and to the rate of direct transmission in order to investigate when it is beneficial to use a certain cooperative strategy. Cooperative transmission makes the ergodic rates approach or even become identical to the upper capacity bounds if some conditions are satisfied. The results show that DF and CF outperform AF as they are more complex strategies, while AF itself achieves higher rates than direct transmission in most channel scenarios, thus trading performance for implementation simplicity.
LA - eng
KW - Gaussian Relay Channel`; Fast Rayleigh Fading; Channel Capacity; Ergodic Rates; Cooperative Strategies; Amplify-and-Forward; Decode-and-Forward; Compress-and-Forward; Wireless Networks
UR - http://eudml.org/doc/268664
ER -
NotesEmbed ?
topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.