Scientific Research and Essays

  • Abbreviation: Sci. Res. Essays
  • Language: English
  • ISSN: 1992-2248
  • DOI: 10.5897/SRE
  • Start Year: 2006
  • Published Articles: 2768

Review

A lower complexity k best algorithm for multiple input multiple output detection

Amjad N. Jabir1, S. Khatun2*, N. K. Noordin1 and B. M. Ali1
1Department of Computer and Communication Systems Engineering, Faculty of Engineering, Universiti Putra Malaysia (UPM), Serdang, Selangor 43400, Malaysia. 2Department of Computer Systems and Networks, Faculty of Computer Systems and Software Engineering, Universiti Malaysia Pahang (UMP), Gambang, Kuantan, Pahang 26300, Malaysia.
Email: [email protected]

  •  Accepted: 19 September 2011
  •  Published: 23 October 2011

Abstract

This paper presents Multiple Input Multiple Output (MIMO) detection steps using tree search based method known as the ‘K’ best algorithm. This low complexity algorithm is based on probabilistic approach of sphere decoding with self adjustable capability depending on the levels (root, branch, leaf etc.) of a tree. While the tree was searched to estimate the transmitted symbols level by level, the algorithm took into account the effect of the undetected symbols in the search criteria. Simulation results showed that the proposed method reduced complexity (in terms of the average number of visited nodes) about 10% for higher (medium to high) signal to noise ratio (SNR) values without degrading the system BER performance.

 

Key words: Multiple input multiple output, sphere decoding, K best algorithm.