EFFICIENT ALGORITHMS FOR FINDING THE K BEST PATHS THROUGH A TRELLIS

被引：43

作者：

CASTANON, DA

机构：

[1] ALPHATECH, Burlington, MA 01803, Inc. SO Mall Road

来源：

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS | 1990年 / 26卷 / 02期

关键词：

D O I：

10.1109/7.53448

中图分类号：

V [航空、航天];

学科分类号：

08 ; 0825 ;

摘要：

A set of algorithms is presented for finding the best set of k mutually exclusive paths through a trellis of N nodes, with worst-case computation time bounded by N3 log(N) for a fixed precision computation. These algorithms are much faster than those proposed recently in [1]. © 1990 IEEE

引用

页码：405 / 409

页数：5