Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
22,758
The Viterbi algorithm
- Proceedings of the IEEE
, 1973
"... vol. 6, no. 8, pp. 211-220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 1765-1775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A ..."
Abstract
-
Cited by 989 (3 self)
- Add to MetaCart
vol. 6, no. 8, pp. 211-220, 1951. [7] J. L. Anderson and J. W..Ryon, “Electromagnetic radiation in accelerated systems, ” Phys. Rev., vol. 181, pp. 1765-1775, 1969. [8] C. V. Heer, “Resonant frequencies of an electromagnetic cavity in an accelerated system of reference, ” Phys. Reu., vol. 134, pp. A799-A804, 1964. [9] T. C. Mo, “Theory of electrodynamics in media in noninertial frames and applications, ” J. Math. Phys., vol. 11, pp. 2589-2610, 1970.
The Viterbi Algorithm
- Proc IEEE, Vol 61, n 3, Mai
, 1973
"... 4 Protein-Ligand energy interaction computation.......... 19 1 ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
4 Protein-Ligand energy interaction computation.......... 19 1
The Viterbi Algorithm Background
"... Convolutional coding is a popular error-correcting coding method used in digital communications. A message is convoluted, and then transmitted into a noisy channel. This convolution operation encodes some redundant information into the transmitted signal, thereby improving the data capacity of the c ..."
Abstract
- Add to MetaCart
of the channel. The Viterbi algorithm is a popular method used to decode convolutionally coded messages. The algorithm tracks down the most likely state sequences the encoder went through in encoding the message, and uses this information to determine the original message. Instead of estimating a message based
The Viterbi Algorithm for Subset Selection
"... Abstract—We study the problem of sparse recovery in an overcomplete dictionary. This problem has attracted considerable attention in signal processing, statistics, and computer science, and a variety of algorithms have been developed to recover the sparse vector. We propose a new method based on the ..."
Abstract
- Add to MetaCart
on the computationally efficient Viterbi algorithm which is shown to achieve better perfor-mance than competing algorithms such as Orthogonal Matching
Generalisation of the Viterbi Algorithm
- IMA J. Management Math
, 1992
"... The Viterbi algorithm, derived using dynamic programming techniques, is a maxi-mum a posteriori (MAP) decoding method which was developed in the electrical engineering literature to be used in the analysis of hidden Markov models (HMMs). Given a particular HMM, the original algorithm recovers the MA ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
The Viterbi algorithm, derived using dynamic programming techniques, is a maxi-mum a posteriori (MAP) decoding method which was developed in the electrical engineering literature to be used in the analysis of hidden Markov models (HMMs). Given a particular HMM, the original algorithm recovers
The Viterbi Algorithm: A Personal History
, 2005
"... The story of the Viterbi algorithm (VA) is told from a personal perspective. Applications both within and beyond communications are discussed. In brief summary, the VA has proved to be an extremely important algorithm in a surprising variety of fields. 1 ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
The story of the Viterbi algorithm (VA) is told from a personal perspective. Applications both within and beyond communications are discussed. In brief summary, the VA has proved to be an extremely important algorithm in a surprising variety of fields. 1
Iterative Viterbi Algorithm for
"... A novel compound code is designed for the popular multi-dimensional (M-D) Wei trellis code [1] combined with a simple parity-check code. Using the iterative Viterbi decoding algorithm, we can achieve a remarkable performance improvement with low computational complexity. Simulation results show that ..."
Abstract
- Add to MetaCart
A novel compound code is designed for the popular multi-dimensional (M-D) Wei trellis code [1] combined with a simple parity-check code. Using the iterative Viterbi decoding algorithm, we can achieve a remarkable performance improvement with low computational complexity. Simulation results show
A temporally abstracted Viterbi algorithm
"... Hierarchical problem abstraction, when applicable, may offer exponential reductions in computational complexity. Previous work on coarse-to-fine dynamic programming (CFDP) has demonstrated this possibility using state abstraction to speed up the Viterbi algorithm. In this paper, we show how to apply ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
Hierarchical problem abstraction, when applicable, may offer exponential reductions in computational complexity. Previous work on coarse-to-fine dynamic programming (CFDP) has demonstrated this possibility using state abstraction to speed up the Viterbi algorithm. In this paper, we show how
The Viterbi algorithm and Markov noise memory
- IEEE Trans. Inform. Theory
, 2000
"... Abstract—This work designs sequence detectors for channels with intersymbol interference (ISI) and correlated (and/or signal-dependent) noise. We describe three major contributions. i) First, by modeling the noise as a finite-order Markov process, we derive the optimal maximum-likelihood sequence de ..."
Abstract
-
Cited by 29 (4 self)
- Add to MetaCart
detector (MLSD) and the optimal maximum a posteriori (MAP) sequence detector, extending to the correlated noise case the Viterbi algorithm. We show that, when the signal-dependent noise is conditionally Gauss–Markov, the branch metrics in the MLSD are computed from the conditional second-order noise
Results 1 - 10
of
22,758
