摘要 : For iterative detection and decoding (IDD) in multiple-input multiple-output (MIMO) systems, the log-likelihood ratio (LLR) of each coded bit can be found by an optimal bit-wise maximum a posteriori probability (MAP) detector. How... 展开 For iterative detection and decoding (IDD) in multiple-input multiple-output (MIMO) systems, the log-likelihood ratio (LLR) of each coded bit can be found by an optimal bit-wise maximum a posteriori probability (MAP) detector. However, since this MAP detector requires a prohibitively high computational complexity, low-complexity suboptimal detectors are desirable. In this paper, lattice reduction (LR)-based MIMO detection is investigated to derive a low-complexity detector that can achieve near MAP performance for IDD. In order to approximate LLR values incorporating the extrinsic information provided by a soft-input soft-output (SISO) decoder, bit-wise LR-based minimum mean square error (MMSE) filters are derived. Furthermore, in order to minimize the performance degradation due to quantization (or rounding) errors in the LR-based detection, a low-complexity integer perturbed list generation method is proposed, where no tree search is used by taking advantage of a near orthogonal channel basis obtained by LR. Through a complexity analysis and simulations, it is shown that the proposed approach achieves near optimal performance, while the complexity is comparable with that of the MMSE soft cancellation method, which is known to be computationally efficient. As a bit-wise detector, a parallel implementation of the proposed method would be straightforward, which lowers the detection delay. 收起