pith. sign in

arxiv: 1710.03791 · v2 · pith:HRHFENRDnew · submitted 2017-10-10 · 💻 cs.IT · math.IT

Hybrid Vector Perturbation Precoding: The Blessing of Approximate Message Passing

classification 💻 cs.IT math.IT
keywords precodinglatticealgorithmbasishybridperformanceaidedapproximate
0
0 comments X
read the original abstract

Vector perturbation (VP) precoding is a promising technique for multiuser communication systems operating in the downlink. In this work, we introduce a hybrid framework to improve the performance of lattice reduction (LR) aided precoding in VP. First, we perform a simple precoding using zero forcing (ZF) or successive interference cancellation (SIC) based on a reduced lattice basis. Since the signal space after LR-ZF or LR-SIC precoding can be shown to be bounded to a small range, then along with sufficient orthogonality of the lattice basis guaranteed by LR, they collectively pave the way for the subsequent application of an approximate message passing (AMP) algorithm, which further boosts the performance of any suboptimal precoder. Our work shows that the AMP algorithm can be beneficial for a lattice decoding problem whose data symbols lie in integers $\mathbb{Z}$ and entries of the lattice basis may bot be i.i.d. Gaussian. Numerical results confirm the low-complexity AMP algorithm can improve the symbol error rate (SER) performance of LR aided precoding significantly. Lastly, the hybrid scheme is also proved effective when solving the data detection problem of massive MIMO systems without using LR.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.