Low Complexity, Quasi-Optimal MIMO Detectors for Iterative Receivers

We propose a novel family of Soft-Input Soft-Output detectors for iterative, point-to-point, MIMO receivers. Compared to the optimal Maximum A Posteriori receiver, low complexity is achieved restricting the detector search to small subsets of the entire QAM hyper-symbol constellation, through simple criteria. These criteria are applied to an improved version of the non-iterative Layered ORthogonal lattice Detector. We show that, notwithstanding the suboptimal low-complexity implementation, this detector approaches the EXtrinsic Information Transfer of the MAP detector. Therefore, when included in an iterative receiver it delivers the same performance. Furthermore, the deterministic complexity and highly parallelizable structure of the proposed detector are well suited for HDL and ASIC implementation. To focus on a specific setting, we consider the indoor MIMO wireless LAN 802.11n standard, taking into account errors in Channel Estimation and a frequency selective, spatially correlated channel model.