pith. sign in

arxiv: 1505.04887 · v1 · pith:ZFVLBOXXnew · submitted 2015-05-19 · 💻 cs.IT · math.IT

A Near-optimal User Ordering Algorithm for Non-iterative Interference Alignment Transceiver Design in MIMO Interfering Broadcast Channels

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

Interference alignment (IA) has recently emerged as a promising interference mitigation technique for interference networks. In this letter, we focus on the IA non-iterative transceiver design problem in a multiple-input-multiple-output interfering broadcast channel (MIMO-IBC), and observed that there is previously unexploited flexibility in different permutations of user ordering. By choosing a good user ordering for a pre-determined IA inter-channel-interference allocation, an improved transceiver design can be accomplished. In order to achieve a more practical performance-complexity tradeoff, a suboptimal user ordering algorithm is proposed. Simulation shows the proposed suboptimal user ordering algorithm can achieve near-optimal performance compared to the optimal ordering while exhibiting only moderate computational complexity.

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.