Iterative Receivers Combining MIMO Detection with Turbo Decoding: Performance-Complexity Trade-offs
Détecteur Itératif pour les récepteurs MIMO : compromis compelxité/performance
Résumé
Recently, iterative receiver combining multiple-input multiple-output (MIMO) detection withchannel decoding has been widely considered to achieve near-capacity performance and reliable highdata rate transmission, for future wireless communication systems. However, such iterativeprocessing increases the computational complexity at the receiver. In this paper, the computationalcomplexity of MIMO detection algorithms combined with turbo decoding is investigated. We firstpresent an overview of the family of MIMO detection algorithms based on sphere decoding, K-Bestdecoding, and interference cancellation. A recently proposed low-complexity K-Best decoder(LC-K-Best) is also presented. Moreover, we analyze the convergence of combining these detectionalgorithms with the turbo decoder using the extrinsic information transfer (EXIT) chart.Consequently, a new scheduling order of the number of iterations for the iterative process isproposed. Several system configurations are developed and compared in terms of performance andcomplexity. Simulations and analytical results show that the new scheduling provides goodperformance with a large saving in the complexity. Additionally, the LC-K-Best decoder shows agood performance-complexity tradeoff, and it is therefore suitable for parallel and pipelinearchitectures that can meet high throughput requirements