## Abstract

Some basic results that help in determining the Diversity-Multiplexing Tradeoff (DMT) of cooperative multihop networks are first identified. As examples, the maximum achievable diversity gain is shown to equal the min-cut between source and sink, whereas the maximal multiplexing gain is shown to equal the minimum rank of the matrix characterizing the MIMO channel appearing across a cut in the network. Two multi-hop generalizations of the two-hop network are then considered, namely layered networks as well as a class of networks introduced here and termed as K -parallel-path (KPP) networks. The DMT of KPP networks is characterized for K > 3. It is shown that a linear DMT between the maximum diversity d_{max} and the maximum multiplexing gain of 1 is achievable for fully-connected, layered networks. Explicit coding schemes achieving the DMT that make use of cyclic-division-algebra-based distributed space-time codes underlie the above results. Two key implications of the results in the paper are that the half-duplex constraint does not entail any rate loss for a large class of cooperative networks and that simple, amplify-and-forward protocols are often sufficient to attain the optimal DMT.

Original language | English |
---|---|

Title of host publication | IEEE Information Theory Workshop 2010, ITW 2010 |

DOIs | |

Publication status | Published - 2010 |

Externally published | Yes |

Event | Information Theory Workshop 2010 (Cairo) - Cairo, Egypt Duration: 6 Jan 2010 → 8 Jan 2010 http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5492134 (Proceedings) |

### Workshop

Workshop | Information Theory Workshop 2010 (Cairo) |
---|---|

Abbreviated title | ITW 2010 |

Country/Territory | Egypt |

City | Cairo |

Period | 6/01/10 → 8/01/10 |

Internet address |