A multi-lattice-reduction aided (MLRA) vector pre-coding algorithm is proposed in this paper. Compared with traditional lattice-reduction-aided (LRA) method, the new method tries to find a set of candidates of perturbation vectors through reducing the formulated lattice to get subspaces of searching space. Within each subspace, a candidate vector is solved. Then the optimum vector is found in this candidate set. Although the searching procedure has slightly more complexity than LRA method, simulation results show that it outperforms the LRA method and fills the performance gap to the sphere decode algorithm with only polynomial complexity.
展开▼
