A simple and accurate approximation for the sum rate of zero forcing dirty paper precoding with greedy user selection

In this paper, we propose a simple and accurate approximation method for the sum rate of greedy zero forcing dirty paper coding (G-ZFDPC). Specifically, we consider a single cell scenario when there exist large number of users. We use a simple probabilistic analysis and drive a quite accurate approximation for the sum rate of G-ZFDPC. The existing approximation results are rather complicated, while our approximation is easily applicable.