Results 121 to 130 of about 3,453 (181)

Viterbi and Viterbi Algorithm based Phase Recovery for Probabilistically Shaped Signals

Journal of Lightwave Technology, 2021
Unlike the scenario in traditional high-order QAM signals, Viterbi and Viterbi (V&V) algorithm becomes more powerful for carrier phase recovery (CPR) in probabilistically shaped (PS) signals. The reason relies on that the PS signals assign much higher probability to the innermost 4 constellation points, which are qualified for V&V algorithm.
Qiulin Zhang, Chester Shu
openaire   +1 more source

Inverting the Viterbi algorithm

Proceedings of the 25th international conference on Machine learning - ICML '08, 2008
Probabilistic grammatical formalisms such as hidden Markov models (HMMs) and stochastic context-free grammars (SCFGs) have been extensively studied and widely applied in a number of fields. Here, we introduce a new algorithmic problem on HMMs and SCFGs that arises naturally from protein and RNA design, and which has not been previously studied.
Michael Schnall-Levin   +2 more
openaire   +1 more source

The Viterbi algorithm for sparse channels

IEEE Transactions on Communications, 1996
This paper presents a reduced complexity Viterbi algorithm for use as sequence estimator for linear intersymbol interference channels with coarsely located coefficients. In particular, the complexity does not depend on the channel impulse response length but only on the number of nonzero coefficients. No approximations are used in the algorithm.
BENVENUTO, NEVIO, MARCHESANI R.
openaire   +2 more sources

Image restoration with the Viterbi algorithm

Journal of the Optical Society of America A, 2000
The 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

Fast decoding viterbi algorithm

Proceedings. 2004 International Conference on Information and Communication Technologies: From Theory to Applications, 2004., 2004
The fast decoding Viterbi algorithm is proposed in this paper, which depends on majority principle for decision. The proposed algorithm is compared with conventional decoding algorithm. The comparison is done by means of decoder initialization with the metric tableset and the possible states of the encoder calculated.
M. Wainakh, I. Abboud, M. Morhej
openaire   +1 more source

The viterbi algorithm

Proceedings of the IEEE, 1973
The Viterbi algorithm (VA) is a recursive optimal solution to the problem of estimating the state sequence of a discrete-time finite-state Markov process observed in memoryless noise. Many problems in areas such as digital communications can be cast in this form.
openaire   +1 more source

Generalisation of the Viterbi algorithm

IMA Journal of Management Mathematics, 1992
Summary: The Viterbi algorithm, derived using dynamic programming techniques, is a maximum 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 MAP state sequence underlying any observation ...
openaire   +2 more sources

Implementing the Viterbi algorithm

IEEE Signal Processing Magazine, 1995
The Viterbi algorithm, an application of dynamic programming, is widely used for estimation and detection problems in digital communications and signal processing. It is used to detect signals in communication channels with memory, and to decode sequential error-control codes that are used to enhance the performance of digital communication systems ...
openaire   +1 more source

Multitarget list Viterbi tracking algorithm

Conference Record of Thirty-Second Asilomar Conference on Signals, Systems and Computers (Cat. No.98CH36284), 2002
We present an approach to multitarget tracking algorithm development. The approach is based on a trellis diagram which depicts the possible progressions of sequences of location measurements, over time. Resulting algorithms are sequential and very flexible in that the approach can handle multiple tracks, track initiation, missed detections, false ...
Perry, Richard.   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy