Results 131 to 140 of about 3,453 (181)

Robustifying the Viterbi Algorithm

2014
We present an efficient algorithm for estimating hidden state sequences in imprecise hidden Markov models (iHMMs), based on observed output sequences. The main difference with classical HMMs is that the local models of an iHMM are not represented by a single mass function, but rather by a set of mass functions.
Cedric De Boom, Jasper De Bock, Arthur Van Camp, Gert de Cooman   +3 more
openaire   +1 more source

Survivor memory reduction in the Viterbi algorithm

IEEE Communications Letters, 2005
This paper presents a novel approach for implementation of the Viterbi algorithm, wherein survivor paths are generally kept in as low as one half of the storage required for traditional trace-back methods. Survivor memory reduction is obtained by storing only the useful part of the survivor paths. In other words, the redundancy in the survivor paths is
A. Abbasfar, null Kung Yao
openaire   +1 more source

Keyword Propagation Viterbi Algorithm

1995
A new search algorithm is proposed for use in the context of automatic speech recognition. This so-called keyword propagation Viterbi algorithm turns out to be completely time synchronous. This means that none of the internal structures has the dimension time.
Paul van Alphen, Jeroen Döll
openaire   +1 more source

Iterative Viterbi algorithm for concatenated multidimensional TCM

2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2002
We apply the iterative Viterbi algorithm (IVA) to decode a concatenated multidimensional TCM in which a trellis code is used as the inner code and a simple even parity code is used as the outer code.
null Qi Wang, null Lei Wei
openaire   +2 more sources

MIMO Detector Based on Viterbi Algorithm

2007 IEEE Workshop on Signal Processing Systems, 2007
Suboptimal detectors of multiple-input multiple-output (MIMO) have been studied because the implementation of the optimum detector, the maximum-likelihood (ML) detector, has so far been considered infeasible for high-rate system. Sphere decoder (SD) using depth-first tree searching and K-best algorithm are used for near optimum detector. SD has the non-
Jin Lee, Sin-Chong Park
openaire   +1 more source

A lower-complexity Viterbi algorithm

1995 International Conference on Acoustics, Speech, and Signal Processing, 2002
In continuous speech recognition, when using statistical language models (e.g. bigrams) a significant amount of time is used every frame to evaluate interword transitions. In fact, if N is the size of vocabulary, O(N/sup 2/) operations are required per frame.
openaire   +1 more source

On bootstrap iterative Viterbi algorithm

1999 IEEE International Conference on Communications (Cat. No. 99CH36311), 2003
A bootstrap iterative Viterbi algorithm (BIVA) is proposed based on a bootstrap structure. Two different modifications are then considered for both very short size blocks (say 100-250 bits) and the medium size blocks (1000-3000 bits). It shows that the iterative decoding can be achieved by using the conventional Viterbi algorithm, which does not ...
openaire   +1 more source

List Viterbi algorithms for continuous transmission

IEEE Transactions on Communications, 2001
Summary: The conventional list Viterbi algorithm (LVA) produces a list of the \(L\) best output sequences over a certain block length in decoding a terminated convolutional code. We show in this paper that the LVA with a sufficiently long list is an optimum maximum-likelihood decoder for the concatenated pair of a convolutional code and a cyclic ...
Chen, Brian, Sundberg, Carl-Erik W.
openaire   +1 more source

Adaptive reduced-state Viterbi algorithm detector

Journal of the Institution of Electronic and Radio Engineers, 1986
The paper describes a novel development of the Viterbi algorithm detector that is suitable for the detection of a convolutionally coded digital signal. The technique enables a substantial reduction in equipment complexity to be achieved, relative to that of the Viterbi algorithm detector, with only a very small reduction in tolerance to noise.
S.B. Aftelak, A.P. Clark
openaire   +1 more source

Convolutional Codes and Viterbi Algorithm

2016
Parallelly to the block codes, the convolutional codes are the second important family of error correcting codes. They are the most important subset of so called tree codes, where some additional limitations are imposed (finite memory order, time invariance, linearity).
Predrag Ivaniš, Dušan Drajić
openaire   +1 more source