In this letter, we propose an efficient algorithm which reduces the complexity of conventional vector perturbation schemes by searching the real and imaginary components of a perturbation vector individually. To minimize a performance loss induced from the decoupled joint search, we apply diagonal precoding at the transmitter whose parameters are iteratively optimized to maximize the chordal distance between subspaces spanned by the real and imaginary components. We also propose a simple non-iterative method with a slight performance loss which can achieve a significant complexity reduction compared to the conventional vector perturbation schemes.
- Multiuser downlink
- vector perturbation
ASJC Scopus subject areas
- Computer Science Applications
- Applied Mathematics
- Electrical and Electronic Engineering