| The Viterbi algorithm (VA) can be reformulated such that the calculations can be performed over a set of independent parallel trellises for a class of sparse channels. This new algorithm named the parallel trellis Viterbi algorithm (PTVA) reduces the complexity of the Viterbi algorithm, however, it has no loss in performance for the special class of intersymbol interference (ISI) channels. Pr...

There is nowadays an increasing interest in list Viterbi decoding, especially for transmission of audio and video over wireless channels. List Viterbi decoding outperforms conventional Viterbi decoding at the expense of an increase in complexity. In this paper, we propose an e cient parallel list Viterbi algorithm with lower computational complexity and memory requirements. ? 2002 Elsevier Scie...

In hidden Markov model-based unit selection synthesis, the benefits of both unit selection and statistical parametric speech synthesis are combined. However, conventional Viterbi algorithm is forced to do a selection also when no suitable units are available. This can drift the search and decrease the overall quality. Consequently, we propose to use robust Viterbi algorithm that can simultaneou...

Forward Error Correction (FEC) schemes are an essential component of wireless communication systems. Convolutional codes are employed to implement FEC but the complexity of corresponding decoders increases exponentially according to the constraint length. Present wireless standards such as Third generation (3G) systems, GSM, 802.11A, 802.16 utilize some configuration of convolutional coding. Co...

Forward Error Correction (FEC) schemes are an essential component of wireless communication systems. Convolutional codes are employed to implement FEC but the complexity of corresponding decoders increases exponentially according to the constraint length. Present wireless standards such as Third generation (3G) systems, GSM, 802.11A, 802.16 utilize some configuration of convolutional coding. Co...

In this paper, we introduce the on-line Viterbi algorithm for decoding hidden Markov models (HMMs) in much smaller than linear space. Our analysis on two-state HMMs suggests that the expected maximum memory used to decode sequence of length n with m-state HMM can be as low as Θ(m log n), without a significant slow-down compared to the classical Viterbi algorithm. Classical Viterbi algorithm req...

Previous works on automatic fingering decision for string instruments have been mainly based on path optimization by minimizing the difficulty of a whole phrase that is typically defined as the sum of the difficulties of moves required for playing the phrase. However, from a practical viewpoint of beginner players, it is more important to minimize the maximum difficulty of a move required for p...

The main purpose of this study is to yield the gains obtained by the developers with the usage of Viterbi algorithm. Research mainly centers on the grandness of Viterbi algorithm in the practical applications with the VHDL code. Research not only helps the students related to the communications but it also helps the people who are in the field of decoders as it is one of the efficient method fo...