On the achievable diversity multiplexing tradeoff of K-user interference channels

Abstract

This paper analyzes diversity multiplexing tradeoff (DMT) of K-user interference channels. We propose a timesharing scheme using both joint decoding and interference alignment (IA), and derive a closed form of its achievable DMT. We show that the achievable DMT is not limited by the maximum of DMTs achieved by joint decoding and IA each but is much better than the maximum of the two. As K increases, the achievable DMT converges, but the DMT improvement by the time-sharing scheme becomes more remarkable. To the best of our knowledge, the time-sharing scheme outperforms any other known schemes in the K-user interference channel in terms of DMT.