Results 161 to 170 of about 2,303,958 (204)
Some of the next articles are maybe not open access.
Two extensions of the Viterbi algorithm
IEEE Transactions on Information Theory, 1991The problem of minimum-cost correction of a corrupted set of data that has been generated by a known finite state machine (FSM) is examined. The Viterbi algorithm is modified to correct insertions and deletions as well as errors, still using a trellis diagram that has the same number of states as the FSM that generates the uncorrupted data.
Anastasios T. Bouloutas +2 more
openaire +2 more sources
A parallel Viterbi decoding algorithm
Concurrency and Computation: Practice and Experience, 2001AbstractIn this paper we express the Viterbi algorithm as a matrix–vector reduction in which multiplication is replaced by addition and addition by minimization. The resulting algorithm is then readily parallelized in a form suitable for implementation on a systolic processor array.
openaire +4 more sources
Image restoration with the Viterbi algorithm
Journal of the Optical Society of America A, 2000The Viterbi algorithm (VA) is known to given an optimal solution to the problem of estimating one-dimensional sequences of discrete-valued pixels corrupted by finite-support blur and memoryless noise. A row-by-row estimation along with decision feedback and vector quantization is used to reduce the computational complexity of the VA and allow the ...
C, Miller +3 more
openaire +2 more sources
Survivor memory reduction in the Viterbi algorithm
IEEE Communications Letters, 2005This 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
Aliazam Abbasfar, Kung Yao
openaire +1 more source
A new architecture for the fast viterbi algorithm
IEEE Transactions on Communications, 2002A novel architecture design to speed up the Viterbi algorithm is proposed. By doubling the number of states in the trellis, the serial operation of a traditional add-compare-select (ACS) unit is transformed into a parallel operation, thus achieving a substantial speed increase. The use of the proposed architecture would increase the speed by 33% at the
Inkyu Lee, Jeff L. Sonntag
openaire +2 more sources
A new transform algorithm for Viterbi decoding
IEEE Transactions on Communications, 1990Implementation of the Viterbi decoding algorithm has attracted a great deal of interest in many applications, but the excessive hardware/time consumption caused by the dynamic and backtracking decoding procedures make it difficult to design efficient VLSI circuits for practical applications.
Kuei-Ann Wen +2 more
openaire +2 more sources
Viterbi algorithm for detecting DDoS attacks
2015 IEEE 40th Conference on Local Computer Networks (LCN), 2015Distributed denial of service attacks aim at making a given computational resource unavailable to users. A substantial portion of commercial Intrusion Detection Systems operates only with detection techniques based on rules for the recognition of pre-established behavioral patterns (called signatures) that can be used to identify these types of attacks.
Wilson Bongiovanni +5 more
openaire +1 more source
A lower-complexity Viterbi algorithm
1995 International Conference on Acoustics, Speech, and Signal Processing, 2002In 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
Viterbi algorithm motives in turbo decoding
IEEE Information Theory Workshop, 2005., 2005This work addresses the problem of decoding turbo convolutional codes. In particular, it is concerned with the question of how maximum likelihood sequence estimation (MLSE), in the shape of the Viterbi algorithm (VA), can be utilized in the framework of turbo decoding. It is shown that the conventional VA, which is a soft-input hard-output decoder, can
Michael Kerner, Ofer Amrani
openaire +2 more sources
Evaluating the Exact Performance of the Viterbi Algorithm
2010 IEEE Wireless Communication and Networking Conference, 2010A Hidden Markov Modeling technique is used to evaluate the exact performance of the Viterbi algorithm for estimating states of a finite state system. This technique is applied to exact calculation of the bit error probability of the Viterbi decoder of a convolutional code in channels with independent errors and in channels with memory.
William Turin, Rittwik Jana
openaire +1 more source