COMPUTATION OF EXTRINSIC INFORMATION IN A BRANCH-AND-BOUND DETECTOR

摘要

The computational complexity associated with detection in multiple-input multiple-output (MIMO) systems often dominates the complexity of the MIMO receiver. Soft-input soft-output detection can significantly improve the error rate performance in iterative MEvIO systems. Branch-and-bound (BB) based detection techniques aim at reducing the computational complexity by transforming MIMO detection into a graph-search problem. The method described in this document computes extrinsic information directly in the BB detector to enable extrinsic LLR clipping, which significantly reduces the computational complexity. As an example, we describe the application of the proposed method to the single tree-search sphere decoding algorithm.