COST reduction algorithm for 8 × 8 lattice reduction aided K-best MIMO detector

This paper proposes a cost reduction algorithm for 8 × 8 lattice-reduction aided K-best multiple-input multiple-output (MIMO) detector. As the MIMO dimension increases, the cost growth and the performance degradation from ML performance become important issues for MIMO detector. This research presents boundary violation decision (BVD), simplified complex enumeration, and differential number (DN) representation to lower the complexity of complex valued lattice reduction aided K-Best detector. The analysis results show that the proposed techniques saves 58% bit registers and 53% combinational circuits with negligible performance degradation compared to ML performance.