Efficient soft-input soft-output tree detection via an improved path metric

Jun Won Choi, Byonghyo Shim, Andrew C. Singer

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

Tree detection techniques are often used to reduce the complexity of a posteriori probability (APP) detection in multiantenna wireless communication systems. In this paper, we introduce an efficient soft-input soft-output tree detection algorithm that employs a new type of look-ahead path metric in the process of branch pruning (or sorting). While conventional path metrics depend only on symbols on a visited path, the new path metric accounts for unvisited parts of the tree in advance through an unconstrained linear estimator and adds a bias term that reflects the contribution of as-yet undecided symbols. By applying the linear estimate-based look-ahead path metric to an M-algorithm that selects the best M paths for each level of the tree, we develop a new soft-input soft-output tree detector, called an improved soft-input soft-output M-algorithm (ISS-MA). Based on an analysis of the probability of correct path loss, we show that the improved path metric offers substantial performance gain over the conventional path metric. We also demonstrate through simulations that the proposed ISS-MA can be a promising candidate for soft-input soft-output detection in high-dimensional systems.

Original languageEnglish
Article number6157084
Pages (from-to)1518-1533
Number of pages16
JournalIEEE Transactions on Information Theory
Volume58
Issue number3
DOIs
Publication statusPublished - 2012 Mar 1

Fingerprint

symbol
Sorting
Communication systems
communication system
Detectors
candidacy
simulation
trend
performance

Keywords

  • Iterative detection and decoding (IDD)
  • k-best search
  • list sphere decoding
  • look-ahead path metric
  • M-algorithm
  • soft-input soft-output detection
  • tree detection
  • turbo principle

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Efficient soft-input soft-output tree detection via an improved path metric. / Choi, Jun Won; Shim, Byonghyo; Singer, Andrew C.

In: IEEE Transactions on Information Theory, Vol. 58, No. 3, 6157084, 01.03.2012, p. 1518-1533.

Research output: Contribution to journalArticle

@article{98144b02182d4823987d136d21ee9dbf,
title = "Efficient soft-input soft-output tree detection via an improved path metric",
abstract = "Tree detection techniques are often used to reduce the complexity of a posteriori probability (APP) detection in multiantenna wireless communication systems. In this paper, we introduce an efficient soft-input soft-output tree detection algorithm that employs a new type of look-ahead path metric in the process of branch pruning (or sorting). While conventional path metrics depend only on symbols on a visited path, the new path metric accounts for unvisited parts of the tree in advance through an unconstrained linear estimator and adds a bias term that reflects the contribution of as-yet undecided symbols. By applying the linear estimate-based look-ahead path metric to an M-algorithm that selects the best M paths for each level of the tree, we develop a new soft-input soft-output tree detector, called an improved soft-input soft-output M-algorithm (ISS-MA). Based on an analysis of the probability of correct path loss, we show that the improved path metric offers substantial performance gain over the conventional path metric. We also demonstrate through simulations that the proposed ISS-MA can be a promising candidate for soft-input soft-output detection in high-dimensional systems.",
keywords = "Iterative detection and decoding (IDD), k-best search, list sphere decoding, look-ahead path metric, M-algorithm, soft-input soft-output detection, tree detection, turbo principle",
author = "Choi, {Jun Won} and Byonghyo Shim and Singer, {Andrew C.}",
year = "2012",
month = "3",
day = "1",
doi = "10.1109/TIT.2011.2177590",
language = "English",
volume = "58",
pages = "1518--1533",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Efficient soft-input soft-output tree detection via an improved path metric

AU - Choi, Jun Won

AU - Shim, Byonghyo

AU - Singer, Andrew C.

PY - 2012/3/1

Y1 - 2012/3/1

N2 - Tree detection techniques are often used to reduce the complexity of a posteriori probability (APP) detection in multiantenna wireless communication systems. In this paper, we introduce an efficient soft-input soft-output tree detection algorithm that employs a new type of look-ahead path metric in the process of branch pruning (or sorting). While conventional path metrics depend only on symbols on a visited path, the new path metric accounts for unvisited parts of the tree in advance through an unconstrained linear estimator and adds a bias term that reflects the contribution of as-yet undecided symbols. By applying the linear estimate-based look-ahead path metric to an M-algorithm that selects the best M paths for each level of the tree, we develop a new soft-input soft-output tree detector, called an improved soft-input soft-output M-algorithm (ISS-MA). Based on an analysis of the probability of correct path loss, we show that the improved path metric offers substantial performance gain over the conventional path metric. We also demonstrate through simulations that the proposed ISS-MA can be a promising candidate for soft-input soft-output detection in high-dimensional systems.

AB - Tree detection techniques are often used to reduce the complexity of a posteriori probability (APP) detection in multiantenna wireless communication systems. In this paper, we introduce an efficient soft-input soft-output tree detection algorithm that employs a new type of look-ahead path metric in the process of branch pruning (or sorting). While conventional path metrics depend only on symbols on a visited path, the new path metric accounts for unvisited parts of the tree in advance through an unconstrained linear estimator and adds a bias term that reflects the contribution of as-yet undecided symbols. By applying the linear estimate-based look-ahead path metric to an M-algorithm that selects the best M paths for each level of the tree, we develop a new soft-input soft-output tree detector, called an improved soft-input soft-output M-algorithm (ISS-MA). Based on an analysis of the probability of correct path loss, we show that the improved path metric offers substantial performance gain over the conventional path metric. We also demonstrate through simulations that the proposed ISS-MA can be a promising candidate for soft-input soft-output detection in high-dimensional systems.

KW - Iterative detection and decoding (IDD)

KW - k-best search

KW - list sphere decoding

KW - look-ahead path metric

KW - M-algorithm

KW - soft-input soft-output detection

KW - tree detection

KW - turbo principle

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

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

U2 - 10.1109/TIT.2011.2177590

DO - 10.1109/TIT.2011.2177590

M3 - Article

VL - 58

SP - 1518

EP - 1533

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 3

M1 - 6157084

ER -