### 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 language | English |
---|---|

Title of host publication | IEEE International Symposium on Information Theory - Proceedings |

Pages | 804-808 |

Number of pages | 5 |

DOIs | |

Publication status | Published - 2010 Aug 23 |

Event | 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States Duration: 2010 Jun 13 → 2010 Jun 18 |

### Other

Other | 2010 IEEE International Symposium on Information Theory, ISIT 2010 |
---|---|

Country | United States |

City | Austin, TX |

Period | 10/6/13 → 10/6/18 |

### Fingerprint

### ASJC Scopus subject areas

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

### Cite this

*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.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*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

}

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 -