An Improved K-Best MIMO Detection Algorithm for Parallel Programmable Baseband Architecture

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 238)


In MIMO-OFDM systems with multiple layers spatial multiplexing and high-order QAM, efficient MIMO detection is very significant for receiver design. Among current MIMO detection algorithms, K-Best is a prevailing algorithm with fixable balance between performance and complexity. However, the current K-Best and its varieties are not suitable for parallel programmable baseband architecture, such as DSP with VLIW, SIMD, or vector processing features. In this chapter, an improved K-Best detection algorithm is proposed, and an efficient soft-output algorithm is designed. Simulation results show that its performance is near to general K-Best with lowered time complexity, especially under high SNR. Using this algorithm, the system throughput can be increased in times.


Tree Search Single Instruction Multiple Data Soft Information Minimum Euclidean Distance MIMO Detection 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.



This work was supported by NSFC (61021001), National Basic Research Program of China (2012CB316002), National S&T Major Project (2010ZX03005-001-02), and China’s 863 Project (Research on the key technology of green networks).


  1. 1.
    Foschini GJ, Gans MJ (1998) On limits of wireless communications in a fading environment when using multiple antennas. Wirel Personal Commun 6(3):311–335CrossRefGoogle Scholar
  2. 2.
    Telatar E (1999) Capacity of multi-antenna Gaussian channels. Eur Trans Telecomm 10(6):585–595CrossRefGoogle Scholar
  3. 3.
    Ong EH, Kneckt J, Alanen O et al (2011) IEEE 802.11ac: enhancements for very high throughput WLANs. 2011 I.E. 22nd international symposium on personal indoor and mobile radio communications (PIMRC), pp 849–853Google Scholar
  4. 4.
    Ghosh A, Ratasuk R, Mondal B et al (2010) LTE-advanced: next-generation wireless broadband technology. IEEE Wirel Commun 17(3):10–22CrossRefGoogle Scholar
  5. 5.
    Ahmadi S (2009) An overview of next-generation mobile WiMAX technology. IEEE Commun Mag 47(6):84–98MathSciNetCrossRefGoogle Scholar
  6. 6.
    Golden GD, Foschini CJ, Valenzuela RA et al (1999) Detection algorithm and initial laboratory results using V-BLAST space-time communication architecture. Electron Lett 35(1):14–16CrossRefGoogle Scholar
  7. 7.
    Haykin S, Sellathurai M, De Jong Y et al (2004) Turbo-MIMO for wireless communications. IEEE Commun Mag 42(10):48–53CrossRefGoogle Scholar
  8. 8.
    Damen MO, El Gamal H, Caire G (2003) On maximum-likelihood detection and the search for the closest lattice point. IEEE Trans Inf Theory 49(10):2389–2402MathSciNetCrossRefGoogle Scholar
  9. 9.
    Fincke U, Phost M (1985) Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Math Comput 44(4):463–471MATHGoogle Scholar
  10. 10.
    David LM, Emesto Z, John RB, Gerhard F (2008) A framework for fixed complexity breadth-first MIMO detection. In: Proceedings of IEEE 10th international symposium on spread spectrum, Bologna, Italy, Aug, pp 129–132Google Scholar
  11. 11.
    Chan AM, Lee I (2002) A new reduced-complexity sphere decoder for multiple antenna systems. IEEE Int Conf Commun 1(7):460–464Google Scholar
  12. 12.
    Fasthuber R, Li M, Novo D, Raghavan P, Van der Perre L, Catthoor F (2009) Novel energy-efficient scalable soft-output SSFE MIMO detector architectures. ICSAMOS, pp 165–171Google Scholar
  13. 13.
    Shabany M, Vahdat BV (2010) A modified complex K-Best scheme for high-speed hard-output MIMO detectors. 2010 53rd IEEE international Midwest symposium on circuits and systems (MWSCAS), pp 845–848Google Scholar
  14. 14.
    Shabany M, Su K, Gulak PG (2008) A pipelined scalable high-throughput implementation of a near-ML K-Best complex lattice decoder. ICASSP: IEEE. ISBN 1-4244-1484-9, S. 3173–3176Google Scholar
  15. 15.
    Li Q, Wang Z (2006) An improved K-Best sphere decoding architecture for MIMO systems. Fortieth Asilomar conference on signals, systems and computers ACSSC’06, pp 2190–2194Google Scholar
  16. 16.
    Studer C, Bölcskei H (2010) Soft-input soft-output single tree-search sphere decoding. IEEE Trans Inf Theory 56(10):4827–4842CrossRefGoogle Scholar
  17. 17.
    Kawai H et al (2005) Likelihood function for QRM-MLD soft-decision turbo decoding and its performance for OFCDM MIMO multiplexing in multipath fading channel. IEICE Trans Commun E88-B(1):47–56CrossRefGoogle Scholar
  18. 18.
    Boutros JJ, Gresset N et al (2003) Soft-input soft-output lattice decoder for linear channels. GLOBECOM, pp 1583–1587Google Scholar

Copyright information

© Springer Science+Business Media New York 2014

Authors and Affiliations

  • Cheng Tan
    • 1
  • Yifei Zhao
    • 1
  • Chunhui Zhou
    • 1
  • Yunzhou Li
    • 1
  1. 1.Wireless and Mobile Communication Technology R&D CenterTsinghua UniversityBeijingChina

Personalised recommendations