Exact capacity analysis of rate adaptive power nonadaptive multibranch multihop decode-and-forward relaying networks

Authors:
Reza Nikjah;Norman C. Beaulieu
Affiliations:
iCORE Wireless Communications Laboratory, Dept. Elect. Comp. Eng., University of Alberta, Edmonton, Alberta, Canada;iCORE Wireless Communications Laboratory, Dept. Elect. Comp. Eng., University of Alberta, Edmonton, Alberta, Canada
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 12
Cited 0

Fundamentals of wireless communication

Fundamentals of wireless communication
Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Average SNR and ergodic capacity analysis for opportunistic DF relaying with outage over Rayleigh fading channels

IEEE Transactions on Wireless Communications
Diversity through coded cooperation

IEEE Transactions on Wireless Communications
Selection Cooperation in Multi-Source Cooperative Networks

IEEE Transactions on Wireless Communications
Performance analysis of single relay selection in rayleigh fading

IEEE Transactions on Wireless Communications
Capacity of fading channels with channel side information

IEEE Transactions on Information Theory
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks

IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior

IEEE Transactions on Information Theory
Capacity bounds and power allocation for wireless relay channels

IEEE Transactions on Information Theory
Cooperative Strategies and Capacity Theorems for Relay Networks

IEEE Transactions on Information Theory
Fading relay channels: performance limits and space-time signal design

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The capacity of rate adaptive, power nonadaptive, multibranch, multihop, decode-and-forward relaying networks is analyzed for ergodically fading channels. Different cases of superimposed, selection, and orthogonal relaying are investigated. Parallel channel coding and repetition coding are considered for each case. Closed-form expressions for the maximum instantaneous achievable rates are obtained for each case. The distribution functions of the maximum instantaneous achievable rates for a source-relay-symmetric (S-R-sym.), relay-destination-symmetric (R-D-sym.) case are evaluated. The ergodic capacity of rate adaptive, power nonadaptive, multibranch, dual-hop networks in the S-R-sym., R-D-sym. case with no-source-destination-link assumption is derived for Rayleigh fading. It is observed that parallel channel coding gain can attain as much as 1 bit improvement for the examples considered. Increasing the number of branches deteriorates the performance of the orthogonal relaying scheme, but improves the performances of the other schemes albeit with diminishing returns. The performances of all schemes degrade rapidly as the number of hops per branch increases, such that no scheme is more energy efficient than direct transmission for more than three hops per branch.