pith. sign in

arxiv: 0807.0204 · v1 · submitted 2008-07-01 · 💻 cs.IT · math.IT

Diversity Multiplexing Tradeoff of Asynchronous Cooperative Relay Networks

classification 💻 cs.IT math.IT
keywords asynchronouscooperativediversitymodelsmultiplexingnetworksrelayachieve
0
0 comments X
read the original abstract

The assumption of nodes in a cooperative communication relay network operating in synchronous fashion is often unrealistic. In the present paper, we consider two different models of asynchronous operation in cooperative-diversity networks experiencing slow fading and examine the corresponding diversity-multiplexing tradeoffs (DMT). For both models, we propose protocols and distributed space-time codes that asymptotically achieve the transmit diversity bound for all multiplexing gains and for any number of relays.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.