Diversity analysis of irregular fractional cooperation

Authors:
Andrew W. Eckford;Josephine P. K. Chu;Raviraj S. Adve
Affiliations:
Dept. of Computer Science and Engineering, York University, Toronto, Ontario, Canada;Dept. of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario, Canada;Dept. of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario, Canada
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 6
Cited 0

Modulation and demodulation for cooperative diversity in wireless systems

IEEE Transactions on Wireless Communications
Low complexity and fractional coded cooperation for wireless networks

IEEE Transactions on Wireless Communications - Part 2
Cooperative diversity in wireless networks: Efficient protocols and outage behavior

IEEE Transactions on Information Theory
Outage analysis of coded cooperation

IEEE Transactions on Information Theory
Capacity of wireless erasure networks

IEEE Transactions on Information Theory
Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

In fractional cooperation, each available relay node selects a small fraction of the source's transmission to be relayed. In previous work, it was assumed that every node relayed the same number of source symbols, and large diversity order gains were observed. In this paper, a theoretical basis is developed for irregular fractional cooperation, in which each node relays a different number of symbols. A general expression of the system diversity order is derived. A bound is introduced on the system performance of fractional cooperation, known as the erasure channel bound. Distributions of diversity order using this bound are given when the fraction relayed by each user is random.