A lower complexity K best algorithm for multiple input and multiple output detection
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 et...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Academic Journals
2011
|
Online Access: | http://psasir.upm.edu.my/id/eprint/23244/1/23244.pdf |
_version_ | 1825925314576908288 |
---|---|
author | Jabir, Amjad Najim Khatun, Sabira Noordin, Nor Kamariah Mohd Ali, Borhanuddin |
author_facet | Jabir, Amjad Najim Khatun, Sabira Noordin, Nor Kamariah Mohd Ali, Borhanuddin |
author_sort | Jabir, Amjad Najim |
collection | UPM |
description | 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. |
first_indexed | 2024-03-06T07:56:18Z |
format | Article |
id | upm.eprints-23244 |
institution | Universiti Putra Malaysia |
language | English |
last_indexed | 2024-03-06T07:56:18Z |
publishDate | 2011 |
publisher | Academic Journals |
record_format | dspace |
spelling | upm.eprints-232442018-10-18T03:29:32Z http://psasir.upm.edu.my/id/eprint/23244/ A lower complexity K best algorithm for multiple input and multiple output detection Jabir, Amjad Najim Khatun, Sabira Noordin, Nor Kamariah Mohd Ali, Borhanuddin 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. Academic Journals 2011 Article PeerReviewed text en http://psasir.upm.edu.my/id/eprint/23244/1/23244.pdf 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 https://academicjournals.org/journal/SRE/article-abstract/2B09CE032140 10.5897/SRE10.1209 |
spellingShingle | Jabir, Amjad Najim Khatun, Sabira Noordin, Nor Kamariah Mohd Ali, Borhanuddin A lower complexity K best algorithm for multiple input and multiple output detection |
title | A lower complexity K best algorithm for multiple input and multiple output detection |
title_full | A lower complexity K best algorithm for multiple input and multiple output detection |
title_fullStr | A lower complexity K best algorithm for multiple input and multiple output detection |
title_full_unstemmed | A lower complexity K best algorithm for multiple input and multiple output detection |
title_short | A lower complexity K best algorithm for multiple input and multiple output detection |
title_sort | lower complexity k best algorithm for multiple input and multiple output detection |
url | http://psasir.upm.edu.my/id/eprint/23244/1/23244.pdf |
work_keys_str_mv | AT jabiramjadnajim alowercomplexitykbestalgorithmformultipleinputandmultipleoutputdetection AT khatunsabira alowercomplexitykbestalgorithmformultipleinputandmultipleoutputdetection AT noordinnorkamariah alowercomplexitykbestalgorithmformultipleinputandmultipleoutputdetection AT mohdaliborhanuddin alowercomplexitykbestalgorithmformultipleinputandmultipleoutputdetection AT jabiramjadnajim lowercomplexitykbestalgorithmformultipleinputandmultipleoutputdetection AT khatunsabira lowercomplexitykbestalgorithmformultipleinputandmultipleoutputdetection AT noordinnorkamariah lowercomplexitykbestalgorithmformultipleinputandmultipleoutputdetection AT mohdaliborhanuddin lowercomplexitykbestalgorithmformultipleinputandmultipleoutputdetection |