DMT analysis of asynchronous OFDM decode-and-forward cooperative networks

Authors:
Mehdi Torbatian;Mohamed Oussama Damen
Affiliations:
Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario;Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, Ontario
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 9
Cited 0

On the design of delay-tolerant distributed space-time codes with minimum length

IEEE Transactions on Wireless Communications
Space-Time code designs based on the generalized binary rank criterion with applications to cooperative diversity

WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

IEEE Transactions on Information Theory
Full-diversity, high-rate space-time block codes from division algebras

IEEE Transactions on Information Theory
Shift-full-rank matrices and applications in space-time trellis codes for relay networks with asynchronous cooperative diversity

IEEE Transactions on Information Theory
Approximately universal codes over slow-fading channels

IEEE Transactions on Information Theory
Delay-Tolerant Distributed-TAST Codes for Cooperative Diversity

IEEE Transactions on Information Theory
Perfect Space–Time Codes for Any Number of Antennas

IEEE Transactions on Information Theory
Diversity–Multiplexing Tradeoff of Asynchronous Cooperative Diversity in Wireless Networks

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

The outage behavior of decode-and-forward (DF) relaying protocol over an asynchronous cooperative network is examined when orthogonal frequency division multiplexing (OFDM) is used to combat synchronization error among the transmitting nodes. We consider non-orthogonal selection DF (NSDF) and orthogonal selection DF (OSDF) protocols, respectively, over a single relay and a two relay cooperative network and analyze the diversity multiplexing gain Tradeoff (DMT) in both scenarios. It is proved that asynchronous protocols provide diversity gains greater than or equal to the one of synchronous counterparts in the limit of code word length and throughout the range of multiplexing gain.