The proliferation of biological sequence data has motivated the need for an extremely fast probabilistic sequence search. One method for performing this search involves evaluating the Viterbi probability of a hidden Markov model (HMM) of a desired sequence family for each sequence in a protein database. However, one of the difficulties with current implementations is the time required to search...

In this paper we address the issue of measurement-to-track association within the framework of multiple hypothesis tracking (MHT). Speciically, we generate a maximum a posteriori (MAP) cost as a function of the number of tracks K. This cost is generated, for each K, as a marginalization over the set of hypothesized track-sets. The proposed algorithm is developed based on a trellis diagram repre...

Conventional HMMs have weak duration constraints. In noisy conditions, the mismatch between corrupted speech signals and models trained on clean speech may cause the decoder to produce word matches with unrealistic durations. This paper presents a simple way to incorporate word duration constraints by unrolling HMMs to form a lattice where word duration probabilities can be applied directly to ...

AbstructAt present, the Viterbi algorithm (VA) is widely used in communication systems for decoding and equalization. The achievable speed of conventional Viterbi decoders (VD’s) is limited by the inherent nonlinear add-compare-select (ACS) recursion. The aim of this paper is to describe system design and VLSI implementation of a complex system of fabricated ASIC’s for high speed Viterbi decodi...

This paper presents algorithms for parallelization of inference in hidden Markov models (HMMs). In particular, we propose parallel backward-forward type filtering and smoothing algorithm as well Viterbi-type maximum-a-posteriori (MAP) algorithm. We define associative elements operators to pose these problems parallel-prefix-sum computations sum-product max-product parallelize them using paralle...

The wide spread use of computers and communication devices in every aspect of life demands the data transmission to be reliable as well as secure. Different design procedures and algorithms are being designed to overcome the security and reliability issues related to transmission of electronic information. Convolutional encoding with Viterbi algorithm is one of the most powerful forward error c...

Many different metrics exist for evaluating parsing results, including Viterbi, Crossing Brackets Rate, Zero Crossing Brackets Rate, and several others. However, most parsing algorithms, including the Viterbi algorithm, attempt to optimize the same metric, namely the probability of getting the correct labelled tree. By choosing a parsing algorithm appropriate for the evaluation metric, better p...

In this paper we study the performance of different classes of M-level line codes under the Viterbi decoding algorithm. Some of the presented M-level line codes inherited the state machine structure by using the technique of distance mappings which preserve the properties of binary convolutional codes. Other M-level line codes were enforced to have the state machine structure to make use of the...