Abstract:

An iterative list branch and bound algorithm is proposed in MIMO detection, which adopts candidate list to compute soft information and reduces computation complexity. Furthermore, an improved algorithm is proposed .It uses a prior information form the preceding iteration and has advantage from recalculating the candidate list. Simulation results show that the proposed iterative algorithm can achieve near-capacity performance and the improved algorithm reduces the required candidate list size without performance degradation.

Key words: MIMO, branch-and-bound, iterative detector