Efficient Tomlinson-Harashima precoding for spatial multiplexing on flat MIMO channel

Nonlinear minimum mean square error Tomlinson-Harashima precoding considered in this paper is an attractive solution for a scenario where a transmitter serves spatially separated receivers and no cooperation among them is possible. Unfortunately, the large performance gain against linear precoding comes along with significantly higher complexity than linear filters in the case of a large number of receivers. We show that superior performance of the nonlinear minimum mean square error Tomlinson-Harashima precoding can be obtained with complexity equivalent to linear precoding. Our proposed algorithm reduces the complexity by a factor of N-R which is the number of receivers.