List Encoding of Vector Perturbation Precoding

Ke Wang

doi:10.1109/LSP.2023.3265328

List Encoding of Vector Perturbation Precoding

2023-01-01

0

PRE

AI

DOI：10.1109/LSP.2023.3265328

Original

Original request for help

Save

Abstract

En 中文

In this letter, we propose a new nonlinear precoding algorithm named List encoding of Vector Perturbation precoding (LVP) for Multiple Input Multiple Output (MIMO) system. Different from the traditional VP based on sphere search strategy to minimize the Frobeniuas norm of the precoded signal with a exponential search complexity, LVP adopts multiple encoders design, a list of encoder perform only one dimensional integer optimization through several iterations in parallel. During each iteration each encoder searches through several perturbation results and retain one of them to the next iteration. When the iterations ends, the historical optimal perturbation result with the least Frobenius norm is output as the precoding result. The search complexity of LVP is O(M) which increases linearly with the antenna number M. This complexity is much smaller than sphere search based strategy. Compared with other low dimensional search algorithm represented by D2VP, the search complexity drops from O(M-2) to O(M), with a significant BER gain thanks to the multiple encoder design. To the best of our knowledge, with similar BER performance the LVP algorithm has the lowest complexity.

Keywords:

Perturbation methods

Precoding

Optimization

Signal processing algorithms

Search problems

Receiving antennas

MIMO communication

Closest point problem

MIMO

nonlinear precoding

VP

List Encoding of Vector Perturbation Precoding

Abstract

Journal

Organization

Cited Papers