Computationally Efficient Vector Perturbation Precoding Using Thresholded Optimization

Abstract

We propose a low-complexity vector perturbation (VP) precoding scheme for the downlink of multi-user multiple input multiple output (MU-MIMO) systems. While conventional VP performs a computationally intensive sphere search through multiple candidate perturbation vectors to minimize the norm of the precoded signal, the proposed precoder applies a threshold to the desired norm to reduce the number of search nodes visited by the sphere encoder. This threshold is determined by the performance requirements of the mobile users. Once the threshold is met, the search for the perturbation vectors finishes thus saving significant computational burden at the transmitter. To evaluate the advantages of the proposed technique compared to VP, we further derive the computational complexity in terms of the volume of the associated search space and the resulting numerical operations. In addition, we use a new performance-complexity metric to study the relevant tradeoff and look at the power efficiency of the system, both of which metrics can be used to optimize the user-determined threshold accordingly\color{black}. The presented analysis and results show that the proposed thresholded VP (TVP) offers a favorable tradeoff between performance and complexity where significant complexity reduction is attained while the user threshold performance is guaranteed.