Hybrid tree search algorithms for detection in spatial multiplexing systems

Kuei-Chiang Lai, Jiun Jie Jia, Li Wei Lin

研究成果: Article

2 引文 (Scopus)

摘要

Hybrid tree search algorithms are described for maximum-likelihood symbol detection in spatial multiplexing (SM) systems. Essentially, the search tree is iteratively expanded in breadth-first (BF) manner until the probability that the current most likely path is correct exceeds the specified threshold, at which point, the depth-first (DF) stage is initiated to traverse the rest of the tree. In contrast with the sphere decoding (SD) algorithm, which starts off with the DF search, the proposed algorithms use the BF stage to enhance the accuracy of the initial DF search direction by exploiting the diversity inherent in the SM scheme. Simulation results demonstrate that, with a moderate increase in the memory requirement, the proposed algorithms achieve a significantly lower complexity than the SD algorithm in many scenarios.

原文English
文章編號5928440
頁(從 - 到)3503-3509
頁數7
期刊IEEE Transactions on Vehicular Technology
60
發行號7
DOIs
出版狀態Published - 2011 九月 1

指紋

Spatial multiplexing
Tree Algorithms
Multiplexing
Search Algorithm
Depth-first Search
Breadth
Decoding
Search Trees
Low Complexity
Trees (mathematics)
Maximum Likelihood
Exceed
Likely
Maximum likelihood
Scenarios
Path
Requirements
Data storage equipment
Demonstrate
Simulation

All Science Journal Classification (ASJC) codes

  • Automotive Engineering
  • Aerospace Engineering
  • Electrical and Electronic Engineering
  • Applied Mathematics

引用此文

@article{2dda6e8c935f46048f871c7b1f10a2dd,
title = "Hybrid tree search algorithms for detection in spatial multiplexing systems",
abstract = "Hybrid tree search algorithms are described for maximum-likelihood symbol detection in spatial multiplexing (SM) systems. Essentially, the search tree is iteratively expanded in breadth-first (BF) manner until the probability that the current most likely path is correct exceeds the specified threshold, at which point, the depth-first (DF) stage is initiated to traverse the rest of the tree. In contrast with the sphere decoding (SD) algorithm, which starts off with the DF search, the proposed algorithms use the BF stage to enhance the accuracy of the initial DF search direction by exploiting the diversity inherent in the SM scheme. Simulation results demonstrate that, with a moderate increase in the memory requirement, the proposed algorithms achieve a significantly lower complexity than the SD algorithm in many scenarios.",
author = "Kuei-Chiang Lai and Jia, {Jiun Jie} and Lin, {Li Wei}",
year = "2011",
month = "9",
day = "1",
doi = "10.1109/TVT.2011.2160464",
language = "English",
volume = "60",
pages = "3503--3509",
journal = "IEEE Transactions on Vehicular Technology",
issn = "0018-9545",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

Hybrid tree search algorithms for detection in spatial multiplexing systems. / Lai, Kuei-Chiang; Jia, Jiun Jie; Lin, Li Wei.

於: IEEE Transactions on Vehicular Technology, 卷 60, 編號 7, 5928440, 01.09.2011, p. 3503-3509.

研究成果: Article

TY - JOUR

T1 - Hybrid tree search algorithms for detection in spatial multiplexing systems

AU - Lai, Kuei-Chiang

AU - Jia, Jiun Jie

AU - Lin, Li Wei

PY - 2011/9/1

Y1 - 2011/9/1

N2 - Hybrid tree search algorithms are described for maximum-likelihood symbol detection in spatial multiplexing (SM) systems. Essentially, the search tree is iteratively expanded in breadth-first (BF) manner until the probability that the current most likely path is correct exceeds the specified threshold, at which point, the depth-first (DF) stage is initiated to traverse the rest of the tree. In contrast with the sphere decoding (SD) algorithm, which starts off with the DF search, the proposed algorithms use the BF stage to enhance the accuracy of the initial DF search direction by exploiting the diversity inherent in the SM scheme. Simulation results demonstrate that, with a moderate increase in the memory requirement, the proposed algorithms achieve a significantly lower complexity than the SD algorithm in many scenarios.

AB - Hybrid tree search algorithms are described for maximum-likelihood symbol detection in spatial multiplexing (SM) systems. Essentially, the search tree is iteratively expanded in breadth-first (BF) manner until the probability that the current most likely path is correct exceeds the specified threshold, at which point, the depth-first (DF) stage is initiated to traverse the rest of the tree. In contrast with the sphere decoding (SD) algorithm, which starts off with the DF search, the proposed algorithms use the BF stage to enhance the accuracy of the initial DF search direction by exploiting the diversity inherent in the SM scheme. Simulation results demonstrate that, with a moderate increase in the memory requirement, the proposed algorithms achieve a significantly lower complexity than the SD algorithm in many scenarios.

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

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

U2 - 10.1109/TVT.2011.2160464

DO - 10.1109/TVT.2011.2160464

M3 - Article

AN - SCOPUS:80052860118

VL - 60

SP - 3503

EP - 3509

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

SN - 0018-9545

IS - 7

M1 - 5928440

ER -