### Abstract

The generalized Viterbi algorithm (GVA) was proposed using variable size list decoder (VLD). The lower bound of its exponent was derived. At some channels, this bound was larger than that of using fixed size list decoder (FLD). Computer simulations result showed that there exists some domains where the proposed scheme has lower error probability for the average retained path size.

Original language | English |
---|---|

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

Pages | 366 |

Number of pages | 1 |

Publication status | Published - 2002 |

Event | 2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland Duration: 2002 Jun 30 → 2002 Jul 5 |

### Other

Other | 2002 IEEE International Symposium on Information Theory |
---|---|

Country | Switzerland |

City | Lausanne |

Period | 02/6/30 → 02/7/5 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering

### Cite this

*IEEE International Symposium on Information Theory - Proceedings*(pp. 366)

**On the generalized viterbi algorithm using likelihood ratio testing.** / Niinomi, Toshihiro; Matsushima, Toshiyasu; Hirasawa, Shigeichi.

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

*IEEE International Symposium on Information Theory - Proceedings.*pp. 366, 2002 IEEE International Symposium on Information Theory, Lausanne, Switzerland, 02/6/30.

}

TY - GEN

T1 - On the generalized viterbi algorithm using likelihood ratio testing

AU - Niinomi, Toshihiro

AU - Matsushima, Toshiyasu

AU - Hirasawa, Shigeichi

PY - 2002

Y1 - 2002

N2 - The generalized Viterbi algorithm (GVA) was proposed using variable size list decoder (VLD). The lower bound of its exponent was derived. At some channels, this bound was larger than that of using fixed size list decoder (FLD). Computer simulations result showed that there exists some domains where the proposed scheme has lower error probability for the average retained path size.

AB - The generalized Viterbi algorithm (GVA) was proposed using variable size list decoder (VLD). The lower bound of its exponent was derived. At some channels, this bound was larger than that of using fixed size list decoder (FLD). Computer simulations result showed that there exists some domains where the proposed scheme has lower error probability for the average retained path size.

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

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

M3 - Conference contribution

AN - SCOPUS:0036353682

SP - 366

BT - IEEE International Symposium on Information Theory - Proceedings

ER -