UPM Institutional Repository

A lower complexity K best algorithm for multiple input and multiple output detection


Citation

Jabir, Amjad Najim and Khatun, Sabira and Noordin, Nor Kamariah and Mohd Ali, Borhanuddin (2011) A lower complexity K best algorithm for multiple input and multiple output detection. Scientific Research and Essays, 6 (24). art. no. 2B09CE032140. pp. 5114-5121. ISSN 1992-2248

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.


Download File

[img] Text
23244.pdf
Restricted to Repository staff only

Download (659kB)

Additional Metadata

Item Type: Article
Divisions: Faculty of Engineering
DOI Number: https://doi.org/10.5897/SRE10.1209
Publisher: Academic Journals
Keywords: Multiple input multiple output; Sphere decoding; K best algorithm
Depositing User: Muizzudin Kaspol
Date Deposited: 03 Nov 2014 02:50
Last Modified: 18 Oct 2018 03:29
Altmetrics: http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.5897/SRE10.1209
URI: http://psasir.upm.edu.my/id/eprint/23244
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item