Low Complexity Tree Searching-Based Iterative Precoding Techniques for Multiuser MIMO Broadcast Channel

Regular Section

Author information

Keywords: precoding, vector perturbation, broadcast channel, MIMO, lattice reduction

JOURNAL RESTRICTED ACCESS

2008 Volume E91.B Issue 6 Pages 2045-2048

DOI https://doi.org/10.1093/ietcom/e91-b.6.2045

Details

Abstract

In this letter, we propose two computationally efficient precoding algorithms that achieve near-ML performance for multiuser MIMO downlink. The proposed algorithms perform tree expansion after lattice reduction. The first full expansion is tried by selecting the first level node with a minimum metric, constituting a reference metric. To find an optimal sequence, they iteratively visit each node and terminate the expansion by comparing node metrics with the calculated reference metric. By doing this, they significantly reduce the number of undesirable node visit. Monte-Carlo simulations show that both proposed algorithms yield near-ML performance with considerable reduction in complexity compared with that of the conventional schemes such as sphere encoding.

Corresponding author

Register with J-STAGE for free!