نتایج جستجو برای: extended viterbi algorithm

تعداد نتایج: 947788  

2014
Ran Zhang Zhengqi Wen Jianhua Tao Ya Li Bing Liu Xiaoyan Lou

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...

2007
Yuichiro Yonebayashi Hirokazu Kameoka Shigeki Sagayama

This paper proposes a Hidden Markov Model (HMM)-based algorithm for automatic decision of piano fingering. We represent the positions and forms of hands and fingers as HMM states and model the resulted sequence of performed notes as emissions associated with HMM transitions. Optimal fingering decision is thus formulated as Viterbi search to find the most likely sequence of state transitions. Th...

Journal: :IEEE Trans. Information Theory 1978
Jack K. Wolf

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 ...

2007
MANJULA SUTAGUNDAR

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...

2008
Tan-Jan Ho

We consider state estimation for a class of jump Markov linear discrete-time systems. For this, we present an algorithm employing switches among two interacting multiple-model extended-Viterbi (IMM-EV) estimators. The models we adopt for describing the systems can be used in problems such as the tracking of targets capable of abrupt maneuvers and fault detection of systems subject to possible c...

2012
R. Sujatha T. M. Rajalaxmi

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 ...

1997
Hui Jiang Keikichi Hirose Qiang Huo

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...

2000
Inkyu Lee Jeff L. Sonntag

A novel architecture design to speed up the Viterbi algorithm is proposed. By increasing the number of states in the trellis, the serial operation of a traditional add–compare–select unit is transformed into a parallel operation, thus achieving a substantial speed increase. The proposed architecture would increase the speed by 33% at the expense of a faily modest increase in area, thus becoming...

2016
Michael Kellman Nelson Morgan

Pitch determination algorithm (PDA) performance typically degrades in the presence of interfering speakers and other periodic sources. We propose a multi-pitch determination algorithm (MPDA) that will detect and estimate two pitch tracks, a dominant and an interferer. Our method aims at being robust to various levels of combination of two speakers. Similar to the Subband Autocorrelation Classif...

2009
Daniil Golod

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...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید