Diversity-multiplexing tradeoff bounds for wireless relay networks

Authors:
John Boyer;David D. Falconer;Halim Yanikomeroglu
Affiliations:
Broadband Communications and Wireless Systems Centre, Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada;Broadband Communications and Wireless Systems Centre, Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada;Broadband Communications and Wireless Systems Centre, Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada
Venue:
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Year:
2009

Citing 7
Cited 2

Introduction to Algorithms

Introduction to Algorithms
Diversity-multiplexing tradeoff bounds for wireless relay networks

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Cooperative Connectivity Models for Wireless Relay Networks

IEEE Transactions on Wireless Communications
Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels

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

IEEE Transactions on Information Theory
On the achievable diversity-multiplexing tradeoff in half-duplex cooperative channels

IEEE Transactions on Information Theory
Multiple-Antenna Cooperative Wireless Systems: A Diversity–Multiplexing Tradeoff Perspective

IEEE Transactions on Information Theory

Opportunistic relaying vs. selective cooperation: analyzing the occurrence-conditioned outage capacity

Proceedings of the 11th international symposium on Modeling, analysis and simulation of wireless and mobile systems
Diversity-multiplexing tradeoff bounds for wireless relay networks

WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper derives bounds on the diversity multiplexing tradeoff of wireless relay networks with arbitrary link connectivity between cooperating terminals. The derived bounds are applicable when there are single and multiple antennas per terminal. Two classes of relaying method are analyzed, those requiring all cooperating terminals to correctly decode the transmitted signal in order for the destination to correctly decode (comprehensive decoding), and those requiring only a subset of cooperating terminals to correctly decode the transmitted signal in order for the destination to correctly decode (destination decoding). It is shown that the diversity multiplexing tradeoff of comprehensive decoding is constrained by the minimum number and arrangement of incident interterminal antenna links across all receiving terminals in the network, and that the diversity-multiplexing tradeoff of destination decoding is constrained by the minimum number and arrangement of incident inter-terminal antenna links across all cut sets in the network. Results for the complexity of the involved minimization algorithms are provided.