The Viterbi algorithm is the optimum decoding algorithm for convolutional codes and has often served as a standard technique in digital communication systems for maximum likelihood sequence estimation. With the Viterbi Algorithm, the computational complexity increases exponentially with the constraint length of the convolutional code. Reducing the constraint length (hence the number of states) ...

This paper is a tutorial introduction to the Viterbi Algorithm, this is reinforced by an example use of the Viterbi Algorithm in the area of error correction in communications channels. Some extensions to the basic algorithm are also discussed briefly. Some of the many application areas where the Viterbi Algorithm has been used are considered, including it's use in communications, target tracki...

This paper is a tutorial introduction to the Viterbi Algorithm, this is reinforced by an example use of the Viterbi Algorithm in the area of error correction in communications channels. Some extensions to the basic algorithm are also discussed briefly. Some of the many application areas where the Viterbi Algorithm has been used are considered, including it's use in communications, target tracki...

Map matching is a key preprocess of trajectory data which recently have become major source for various transport applications and location-based services. In this paper, an online map algorithm based on the second-order hidden Markov model (HMM) proposed processing in complex urban road networks such as parallel segments intersections. Several factors driver’s travel preference, network topolo...

Viterbi algorithm is widely used in communication systems to efficiently decode the convolutional codes. This algorithm is used in many applications including cellular and satellite communication systems. Moreover, Serializer-deserializers (SERDESs) having critical latency constraint also use viterbi algorithm for hardware implementation. We present the integration of a mixed hardware/software ...

To estimate the emission parameters in hidden Markov models one commonly uses the EM algorithm or its variation. Our primary motivation, however, is the Philips speech recognition system wherein the EM algorithm is replaced by the Viterbi training algorithm. Viterbi training is faster and computationally less involved than EM, but it is also biased and need not even be consistent. We propose an...

We consider estimation of the emission parameters in hidden Markov models. Commonly, one uses the EM algorithm for this purpose. However, our primary motivation is the Philips speech recognition system wherein the EM algorithm is replaced by the Viterbi training algorithm. Viterbi training is faster and computationally less involved than EM, but it is also biased and need not even be consistent...

Using the Viterbi decoding algorithm with repeat request for convolutional codes is proposed, and the resuking performance is analyzed by random coding aud generatiug function arguments and by simtdation. It is &own that the reliability function of tbe proposed decoding algorithm is asymptotically twice that of the Viterbi decoding algorithm without repeat request, and that in certain practical...

Extracting instantaneous frequency (IF) of Micro-Doppler (M-D) is the key to estimating micro-motion parameters. In this paper, firstly, the micro-motion model of coning was set up. Meanwhile, the theoretical analysis and derivation of micro-Doppler were performed. Then we introduced occlusion effect and Time Frequency transform to better accord with the complexity and reality of feature extrac...