Hierarchical tree search for runtime-constrained soft-output MIMO detection

Kyung Jun Choi, Kwang Soon Kim

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

In this paper, a novel low-complexity tree-search (TS) algorithm, which is referred to as a hierarchical tree search (HTS), is proposed for soft-output multiple-input-multiple-output (MIMO) detection to mitigate the performance loss caused by an early termination. The proposed HTS algorithm is realized by the following two components: the hierarchical set partitioning to find all hypotheses with reasonable quality as fast as possible and to fairly improve them and the new cost metric to determine the search order by considering the quality of the hypotheses found so far. Through simulation, it is shown that the performance-complexity tradeoff of the proposed HTS algorithm surpasses those of the existing algorithms in various MIMO configurations.

Original languageEnglish
Article number6353996
Pages (from-to)890-896
Number of pages7
JournalIEEE Transactions on Vehicular Technology
Volume62
Issue number2
DOIs
Publication statusPublished - 2013 Jan 1

Fingerprint

Search Trees
Multiple-input multiple-output (MIMO)
Tree Algorithms
Search Algorithm
Output
Early Termination
Set Partitioning
Low Complexity
Trade-offs
Metric
Configuration
Costs
Simulation

All Science Journal Classification (ASJC) codes

  • Automotive Engineering
  • Aerospace Engineering
  • Computer Networks and Communications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

@article{795180321c594003b63c54312d0885ab,
title = "Hierarchical tree search for runtime-constrained soft-output MIMO detection",
abstract = "In this paper, a novel low-complexity tree-search (TS) algorithm, which is referred to as a hierarchical tree search (HTS), is proposed for soft-output multiple-input-multiple-output (MIMO) detection to mitigate the performance loss caused by an early termination. The proposed HTS algorithm is realized by the following two components: the hierarchical set partitioning to find all hypotheses with reasonable quality as fast as possible and to fairly improve them and the new cost metric to determine the search order by considering the quality of the hypotheses found so far. Through simulation, it is shown that the performance-complexity tradeoff of the proposed HTS algorithm surpasses those of the existing algorithms in various MIMO configurations.",
author = "Choi, {Kyung Jun} and Kim, {Kwang Soon}",
year = "2013",
month = "1",
day = "1",
doi = "10.1109/TVT.2012.2227868",
language = "English",
volume = "62",
pages = "890--896",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

Hierarchical tree search for runtime-constrained soft-output MIMO detection. / Choi, Kyung Jun; Kim, Kwang Soon.

In: IEEE Transactions on Vehicular Technology, Vol. 62, No. 2, 6353996, 01.01.2013, p. 890-896.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Hierarchical tree search for runtime-constrained soft-output MIMO detection

AU - Choi, Kyung Jun

AU - Kim, Kwang Soon

PY - 2013/1/1

Y1 - 2013/1/1

N2 - In this paper, a novel low-complexity tree-search (TS) algorithm, which is referred to as a hierarchical tree search (HTS), is proposed for soft-output multiple-input-multiple-output (MIMO) detection to mitigate the performance loss caused by an early termination. The proposed HTS algorithm is realized by the following two components: the hierarchical set partitioning to find all hypotheses with reasonable quality as fast as possible and to fairly improve them and the new cost metric to determine the search order by considering the quality of the hypotheses found so far. Through simulation, it is shown that the performance-complexity tradeoff of the proposed HTS algorithm surpasses those of the existing algorithms in various MIMO configurations.

AB - In this paper, a novel low-complexity tree-search (TS) algorithm, which is referred to as a hierarchical tree search (HTS), is proposed for soft-output multiple-input-multiple-output (MIMO) detection to mitigate the performance loss caused by an early termination. The proposed HTS algorithm is realized by the following two components: the hierarchical set partitioning to find all hypotheses with reasonable quality as fast as possible and to fairly improve them and the new cost metric to determine the search order by considering the quality of the hypotheses found so far. Through simulation, it is shown that the performance-complexity tradeoff of the proposed HTS algorithm surpasses those of the existing algorithms in various MIMO configurations.

UR - http://www.scopus.com/inward/record.url?scp=84873934836&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84873934836&partnerID=8YFLogxK

U2 - 10.1109/TVT.2012.2227868

DO - 10.1109/TVT.2012.2227868

M3 - Article

VL - 62

SP - 890

EP - 896

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 2

M1 - 6353996

ER -