Linear estimate-based look-ahead path metric for efficient soft-input soft-output tree detection

Jun Won Choi, Byonghyo Shim, Andrew C. Singer

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we propose a new path metric, which improves performance of soft-input soft-output tree detection for iterative detection and decoding (IDD) systems. While the conventional path metric accounts for the contribution of symbols on a visited path due to the causal nature of tree search, the new path metric reflect the contribution of unvisited paths using an unconstrained soft estimate of undecided symbols. This path metric, referred to as a linear estimate-based look-ahead (LE-LA) path metric is applied to a soft-input soft-output M-algorithm that finds a list of promising symbol candidates and computes a posteriori probability of each entry of the symbol vector using the candidate list found. Through the analysis of a probability of correct path loss (CPL) and computer simulations, we show performance gain of the LE-LA path metric over the conventional path metric.

Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages804-808
Number of pages5
DOIs
Publication statusPublished - 2010 Aug 23
Event2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States
Duration: 2010 Jun 132010 Jun 18

Other

Other2010 IEEE International Symposium on Information Theory, ISIT 2010
CountryUnited States
CityAustin, TX
Period10/6/1310/6/18

Fingerprint

Look-ahead
Metric
Path
Output
Estimate
Decoding
Computer simulation
Iterative Detection
Iterative Decoding
Path Loss
Search Trees
Computer Simulation

ASJC Scopus subject areas

  • Applied Mathematics
  • Modelling and Simulation
  • Theoretical Computer Science
  • Information Systems

Cite this

Choi, J. W., Shim, B., & Singer, A. C. (2010). Linear estimate-based look-ahead path metric for efficient soft-input soft-output tree detection. In IEEE International Symposium on Information Theory - Proceedings (pp. 804-808). [5513641] https://doi.org/10.1109/ISIT.2010.5513641

Linear estimate-based look-ahead path metric for efficient soft-input soft-output tree detection. / Choi, Jun Won; Shim, Byonghyo; Singer, Andrew C.

IEEE International Symposium on Information Theory - Proceedings. 2010. p. 804-808 5513641.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Choi, JW, Shim, B & Singer, AC 2010, Linear estimate-based look-ahead path metric for efficient soft-input soft-output tree detection. in IEEE International Symposium on Information Theory - Proceedings., 5513641, pp. 804-808, 2010 IEEE International Symposium on Information Theory, ISIT 2010, Austin, TX, United States, 10/6/13. https://doi.org/10.1109/ISIT.2010.5513641
Choi JW, Shim B, Singer AC. Linear estimate-based look-ahead path metric for efficient soft-input soft-output tree detection. In IEEE International Symposium on Information Theory - Proceedings. 2010. p. 804-808. 5513641 https://doi.org/10.1109/ISIT.2010.5513641
Choi, Jun Won ; Shim, Byonghyo ; Singer, Andrew C. / Linear estimate-based look-ahead path metric for efficient soft-input soft-output tree detection. IEEE International Symposium on Information Theory - Proceedings. 2010. pp. 804-808
@inproceedings{46222f34519040ebac57c811f865ee34,
title = "Linear estimate-based look-ahead path metric for efficient soft-input soft-output tree detection",
abstract = "In this paper, we propose a new path metric, which improves performance of soft-input soft-output tree detection for iterative detection and decoding (IDD) systems. While the conventional path metric accounts for the contribution of symbols on a visited path due to the causal nature of tree search, the new path metric reflect the contribution of unvisited paths using an unconstrained soft estimate of undecided symbols. This path metric, referred to as a linear estimate-based look-ahead (LE-LA) path metric is applied to a soft-input soft-output M-algorithm that finds a list of promising symbol candidates and computes a posteriori probability of each entry of the symbol vector using the candidate list found. Through the analysis of a probability of correct path loss (CPL) and computer simulations, we show performance gain of the LE-LA path metric over the conventional path metric.",
author = "Choi, {Jun Won} and Byonghyo Shim and Singer, {Andrew C.}",
year = "2010",
month = "8",
day = "23",
doi = "10.1109/ISIT.2010.5513641",
language = "English",
isbn = "9781424469604",
pages = "804--808",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Linear estimate-based look-ahead path metric for efficient soft-input soft-output tree detection

AU - Choi, Jun Won

AU - Shim, Byonghyo

AU - Singer, Andrew C.

PY - 2010/8/23

Y1 - 2010/8/23

N2 - In this paper, we propose a new path metric, which improves performance of soft-input soft-output tree detection for iterative detection and decoding (IDD) systems. While the conventional path metric accounts for the contribution of symbols on a visited path due to the causal nature of tree search, the new path metric reflect the contribution of unvisited paths using an unconstrained soft estimate of undecided symbols. This path metric, referred to as a linear estimate-based look-ahead (LE-LA) path metric is applied to a soft-input soft-output M-algorithm that finds a list of promising symbol candidates and computes a posteriori probability of each entry of the symbol vector using the candidate list found. Through the analysis of a probability of correct path loss (CPL) and computer simulations, we show performance gain of the LE-LA path metric over the conventional path metric.

AB - In this paper, we propose a new path metric, which improves performance of soft-input soft-output tree detection for iterative detection and decoding (IDD) systems. While the conventional path metric accounts for the contribution of symbols on a visited path due to the causal nature of tree search, the new path metric reflect the contribution of unvisited paths using an unconstrained soft estimate of undecided symbols. This path metric, referred to as a linear estimate-based look-ahead (LE-LA) path metric is applied to a soft-input soft-output M-algorithm that finds a list of promising symbol candidates and computes a posteriori probability of each entry of the symbol vector using the candidate list found. Through the analysis of a probability of correct path loss (CPL) and computer simulations, we show performance gain of the LE-LA path metric over the conventional path metric.

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

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

U2 - 10.1109/ISIT.2010.5513641

DO - 10.1109/ISIT.2010.5513641

M3 - Conference contribution

SN - 9781424469604

SP - 804

EP - 808

BT - IEEE International Symposium on Information Theory - Proceedings

ER -