### 抄録

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.

元の言語 | English |
---|---|

ホスト出版物のタイトル | IEEE International Symposium on Information Theory - Proceedings |

ページ | 366 |

ページ数 | 1 |

出版物ステータス | Published - 2002 |

イベント | 2002 IEEE International Symposium on Information Theory - Lausanne, Switzerland 継続期間: 2002 6 30 → 2002 7 5 |

### Other

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

国 | Switzerland |

市 | Lausanne |

期間 | 02/6/30 → 02/7/5 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering

### これを引用

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

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

研究成果: 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 -