Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 3,082 papers for “Viterbi algorithm”

Viterbi Algorithm

Claude Sammut, Geoffrey I. Webb · Encyclopedia of Machine Learning and Data Mining · 2017

Cited by 0

The Viterbi Algorithm

John van der Hoek, Robert J. Elliott · Cambridge University Press eBooks · 2018

A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.

Cited by 2

The Viterbi Algorithm

Prof Dr, Fatimah Dato Ahmad, Associate Prof et al. · 1973

The Journal Secretariat would like to express their heartfelt appreciation to all contributors and reviewers involved in the publishing process of this journal. e-ISSN: 2289-2664 Editor-in-Chief Prof. Dr. TENGKU MOHD TENGKU SEMBOK

Cited by 0

Iterative Viterbi Algorithm for

Concatenated Multi-Dimensional Tcm, Qi Wang, Lei Wei Senior Member · 2007

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 at a bit-error-rate (BER) of 3:7 10 about 2.2 dB additional net gain has been obtained over the conventional scheme of the 4-D 16-state Wei code at a spectral eciency of 6.7871 bits/T .

Cited by 0

Inverting the Viterbi algorithm

Michael Schnall-Levin, Leonid Chindelevitch, Bonnie Berger · 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. The problem can be viewed as an inverse to the one solved by the Viterbi algorithm on HMMs or by the CKY algorithm on SCFGs. We study this problem theoretically and obtain the first algorithmic results. We prove that the problem is NP-complete, even for a 3-letter emission alphabet, via a reduction from 3-SAT, a result that has implications for the hardness of RNA secondary structure design. We then develop a number of approaches for making the problem tractable. In particular, for HMMs we develop a branch-and-bound algorithm, which can be shown to have fixed-parameter tractable worst-case running time, exponential in the number of states of the HMM but linear in the length of the structure. We also show how to cast the problem as a Mixed Integer Linear Program.

Cited by 26

Parallel processing for Viterbi algorithm

Kuei Ann Wen, Jau Yien Lee · Electronics Letters · 1988

Dual-dimensional parallelisation for the Viterbi algorithm is exploited. That is, parallelisation of the decoding procedures within each stage of the trellis and parallelisation of the decoding procedures are expanded to consecutive stages without excessive path memories. Since an arbitrary number of stages can be parallelised, the trade-off between computation speed and degree of integration can be adjusted as required.

Cited by 7

Iterative Viterbi algorithm: Implementation issues

Journal of International Crisis and Risk Communication Research · 2004

We address several issues for implementing the iterative Viterbi decoder. We show that 3-bit branch metric quantization, 7- or 8-bit state metric precision, and a survivor length of five times the constraint length yields little degradation for the iterative Viterbi algorithm (IVA). Our results show that without changing the VA hardware (except adding some additional circuits), the error performance of several standard systems can be significantly improved.

Cited by 0Open access

Improvement of Viterbi Decoding Algorithm

Lihua Li · 2009

Viterbi algorithm decoding is a kind of maximum likelihood decoding.In this paper,the improvement of Viterbi algorithm is produced.The experiment results show that it can overcome the drawback of the decoding performance greatly degraded,when burst errors occur,and reduce the decoding complexity while the good characteristic of conventional Viterbi algorithm remains uncharged.Simulations over coding channel show that the more correct bits we know the better the performance is.

Cited by 0

Iterative Viterbi Algorithm: Implementation Issues

Wei, Lei · Journal of International Crisis and Risk Communication Research · 2004

We address several issues for implementing the iterative Viterbi decoder. We show that 3-bit branch metric quantization, 7- or 8-bit state metric precision, and a survivor length of five times the constraint length yields little degradation for the iterative Viterbi algorithm (IVA). Our results show that without changing the VA hardware (except adding some additional circuits), the error performance of several standard systems can be significantly improved.

Cited by 0Open access

On bootstrap iterative Viterbi algorithm

Lei Wei · 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 require the noise variance estimation. The numerical results show the significant performance improvement over the standard Viterbi algorithm is possible. For a block length of 1500 bits and with a 32 state VA, the 2D BIVA can achieve a bit error rate of 2/spl times/10/sup -5/ at an E/sub b//E/sub 0/ of 2.3 dB away from the Shannon limit. For both information block lengths of 1944 and 11970 bits, in term of its performance respect to the Shannon limit and the Shannon sphere packing bound, the 2D-BIVA is about 0.2-0.3 dB worse than the best known rate 1/2 JPL turbo codes of similar information block sizes. With some simple modifications, most of current systems (where the Viterbi algorithms used) can benefit significantly from this iterative decoding procedure.

Cited by 7

Viterbi and Viterbi Algorithm based Phase Recovery for Probabilistically Shaped Signals

Qiulin Zhang, Chester Shu · Journal of Lightwave Technology · 2020

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. In this article, we compare the performance of V&V algorithm to that of blind phase search (BPS) algorithm for PS-64 QAM and PS-256 QAM in the aspects of window size and signal to noise ratio under the constraint of different laser linewidths. Besides, the impact of signal entropy on both algorithms is investigated. The computational complexity and running time for both algorithms are also summarized. Results show that the two algorithms perform similarly for PS-64 QAM signals when the linewidth is less than 1 MHz while the running time of BPS algorithm is at least 45 times longer than that of V&V algorithm. Finally, we conduct a coherent detection based optical back-to-back experiment where the laser linewidths of both transmitter laser and local oscillator are 100 kHz. For PS-64 QAM, both V&V and BPS algorithms show negligible penalty compared to the performance of homodyne detection, verifying the feasibility of applying V&V algorithm in the CPR of PS-64 QAM.

Cited by 25