On the VLSI Implementation of low complexity K-best MIMO decoders

The VLSI implementation of maximum likelihood (ML) detection for higher order multiple input multiple output (MIMO) systems continues to be a major challenge. Battery driven handheld devices impose strict area and power constraints while demanding guaranteed performance over a wide range of operating conditions. This paper presents a modified, low complexity K-best detector for a 4×4, 64 QAM MIMO system , which uses a modified path extension algorithm to bring down the computational complexity by more than 50%. It also exploits the structure of a QAM constellation to achieve low power operation by reducing the number of costly multiplication operations while computing the path metrics. The two new approaches, combined with a resource shared architecture leads to the implementation of a very efficient FPGA based system, where we verify the performance of the algorithm.

[1]  Andreas Peter Burg,et al.  K-best MIMO detection VLSI architectures achieving up to 424 Mbps , 2006, 2006 IEEE International Symposium on Circuits and Systems.

[2]  A. Burg,et al.  VLSI implementation of MIMO detection using the sphere decoding algorithm , 2005, IEEE Journal of Solid-State Circuits.

[3]  Tong Zhang,et al.  Nonlinear Soft-Output Signal Detector Design and Implementation for MIMO Communication Systems with High Spectral Efficiency , 2006, IEEE Custom Integrated Circuits Conference 2006.

[4]  Joachim Hagenauer,et al.  Iterative detection of MIMO transmission using a list-sequential (LISS) detector , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[5]  Zhan Guo,et al.  Algorithm and implementation of the K-best sphere decoding for MIMO detection , 2006, IEEE Journal on Selected Areas in Communications.

[6]  Stephan ten Brink,et al.  Achieving near-capacity on a multiple-antenna channel , 2003, IEEE Trans. Commun..