Greedy Tomlinson-Harashima Precoding with scheduling and receiver processing for downlink MU-MIMO

Abstract

MuIti-user MIMO (MU-MIMO) has been adopted in the next génération mobile wireless communications. Precoding is a key technique to achieve downlink MU-MIMO capacity. The Tomlinson-Harashima Preceding (TUP) is a practical implementation of the Zero-Forcing Dirty Paper Coding (ZF-DPC), and achieves better sum capacity performance than linear precoding, for example, Block Diagonalization (BD). Both scheduling and receiver processing (or post-coding) are tightly connected to the precoding and arc important for achieving higher capacity. However, for TUP, so far, there is no method that can do scheduling and receiver processing simultaneously. In this paper, we propose a method that can combine the two. It is shown that the proposed method can achieve better scheduling performance and better receiver processing performance, compared with the existing scheduling or receiver processing algorithms for TUP. Besides, the complexity of the proposed method is lower.