Abstract— The paper describes the application of the Viterbi algorithm in the implmentation of a maximum likelihood receiver in a chaos communication scheme. The Viterbi decoder is constructed based on a symbolic state representation of the transmitter’s chaos generator. The presented simulation results show that the classical Binary Phase Shift Keying (BPSK) modulation scheme can be slightly o...

The hybrid speech synthesis system, which combines the hidden Markov model and unit selection method, has become an additional main stream in state-of-the-art TTS systems. However, traditional Viterbi algorithm is based on global minimization of a cost function and the procedure can end up selecting some poor-quality units with larger local errors, which can hardly be tolerated by the listeners...

It is shown that soft decision maximum likelihood decoding of any (n,k) linear block code over GF(q) can be accomplished using the Viterbi algorithm applied to a trellis with no more than q (n-k) states. For cyclic codes, the trellis is periodic. When this technique is applied to the decoding of product codes, the number of states in the trellis can be much fewer than q n-k. For a binary (n,rz ...

This paper presents implementation of a soft decision Viterbi decoder suitable for convolution codes with short constraint lengths. The decoder is based on a property of Viterbi algorithm that states “if the survivor paths from all possible states at time n are traced back then with high probability all the paths merge at time n-L where L is the survivor path length”. Pipeline structures are in...

Abstract Modified Viterbi algorithm of FHMC [10] is the method for tracking the hidden states of a process from a sequence of given observation sequence. An important problem while tracking a process with an FHMC is estimating the uncertainty present in the solution. To overcome this kind of uncertainty we need to compute the entropy of a state sequence. The entropy of a possibilistic variable ...

In this paper, we investigate a new Bayesian predictive classi cation (BPC) approach to realize robust speech recognition when there exist mismatches between training and test conditions but no accurate knowledge of the mismatch mechanism is available. A speci c approximate BPC algorithm called Viterbi BPC (VBPC) is proposed for both isolated word and continuous speech recognition. The proposed...

Traditional algorithms for hidden Markov model decoding seek to maximize either the probability of a state path or the number of positions of a sequence assigned to the correct state. These algorithms provide only a single answer and in practice do not produce good results. The most mathematically sound of these algorithms is the Viterbi algorithm, which returns the state path that has the high...

This paper proposes a new blind sequence estimation method for single-input single-output (SISO) systems utilizing an optimal trellis search, which is performed by a channel-independent Viterbi algorithm (CIVA). In contrast to the traditional Viterbi algorithm that requires accurate channel estimation, CIVA does not require channel coefficients. Instead, the metrics are calculated from a bank o...

We propose a novel carrier phase estimator based on two-stage Viterbi-Viterbi and QPSK partitioning for 16-QAM. Simulation shows that the proposed algorithm is highly tolerant to laser linewidth with a reduced cycle slip probability. OCIS codes: (060.2330) Fiber Optics Communications; (060.1660) Coherent Communications