Diversity-Multiplexing Tradeoff Bounds for Wireless Relay Networks

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 inter- terminal 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.