Log in

Relevant bibliographies by topics / Viterbi Algorithm / Journal articles

Journal articles on the topic 'Viterbi Algorithm'

To see the other types of publications on this topic, follow the link: Viterbi Algorithm.

Author: Grafiati

Published: 4 June 2021

Last updated: 11 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Viterbi Algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Monfared, Saleh Khalaj, Omid Hajihassani, Vahid Mohsseni, Dara Rahmati, and Saeid Gorgin. "A High-throughput Parallel Viterbi Algorithm via Bitslicing." ACM Transactions on Parallel Computing 8, no. 4 (December 31, 2021): 1–25. http://dx.doi.org/10.1145/3470642.

Full text

Abstract:

In this work, we present a novel bitsliced high-performance Viterbi algorithm suitable for high-throughput and data-intensive communication. A new column-major data representation scheme coupled with the bitsliced architecture is employed in our proposed Viterbi decoder that enables the maximum utilization of the parallel processing units in modern parallel accelerators. With the help of the proposed alteration of the data scheme, instead of the conventional bit-by-bit operations, 32-bit chunks of data are processed by each processing unit. This means that a single bitsliced parallel Viterbi decoder is capable of decoding 32 different chunks of data simultaneously. Here, the Viterbi’s Add-Compare-Select procedure is implemented with our proposed bitslicing technique, where it is shown that the bitsliced operations for the Viterbi internal functionalities are efficient in terms of their performance and complexity. We have achieved this level of high parallelism while keeping an acceptable bit error rate performance for our proposed methodology. Our suggested hard and soft-decision Viterbi decoder implementations on GPU platforms outperform the fastest previously proposed works by and , achieving 21.41 and 8.24 Gbps on Tesla V100, respectively.

APA, Harvard, Vancouver, ISO, and other styles

2

Viterbi, Andrew. "Viterbi algorithm." Scholarpedia 4, no. 1 (2009): 6246. http://dx.doi.org/10.4249/scholarpedia.6246.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Lou, H. L. "Implementing the Viterbi algorithm." IEEE Signal Processing Magazine 12, no. 5 (1995): 42–52. http://dx.doi.org/10.1109/79.410439.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Muhammad, Shamsuddeen Hassan, and Abdulrasheed Mustapha. "A Form of List Viterbi Algorithm for Decoding Convolutional Codes." U.Porto Journal of Engineering 4, no. 2 (October 31, 2018): 42–48. http://dx.doi.org/10.24840/2183-6493_004.002_0004.

Full text

Abstract:

Viterbi algorithm is a maximum likelihood decoding algorithm. It is used to decode convolutional code in several wireless communication systems, including Wi-Fi. The standard Viterbi algorithm gives just one decoded output, which may be correct or incorrect. Incorrect packets are normally discarded thereby necessitating retransmission and hence resulting in considerable energy loss and delay. Some real-time applications such as Voice over Internet Protocol (VoIP) telephony do not tolerate excessive delay. This makes the conventional Viterbi decoding strategy sub-optimal. In this regard, a modified approach, which involves a form of List Viterbi for decoding the convolutional code is investigated. The technique employed combines the bit-error correction capabilities of both the Viterbi algorithm and the Cyclic Redundancy Check (CRC) procedures. It first uses a form of ‘List Viterbi Algorithm’ (LVA), which generates a list of possible decoded output candidates after the trellis search. The CRC check is then used to determine the presence of correct outcome. Results of experiments conducted using simulation shows considerable improvement in bit-error performance when compared to classical approach.

APA, Harvard, Vancouver, ISO, and other styles

5

Xu, Hui Hong. "Speaker Recognition Study Based on Optimized HMM Algorithm." Advanced Materials Research 765-767 (September 2013): 2809–12. http://dx.doi.org/10.4028/www.scientific.net/amr.765-767.2809.

Full text

Abstract:

The article has carried on the optimization to the HMM algorithms Viterbi algorithm and LBG algorithm, It can be proofed that the optimized algorithm improved the text dependent recognition efficiency throgh experiment.

APA, Harvard, Vancouver, ISO, and other styles

6

GOLOD, DANIIL, and DANIEL G. BROWN. "A TUTORIAL OF TECHNIQUES FOR IMPROVING STANDARD HIDDEN MARKOV MODEL ALGORITHMS." Journal of Bioinformatics and Computational Biology 07, no. 04 (August 2009): 737–54. http://dx.doi.org/10.1142/s0219720009004242.

Full text

Abstract:

In this tutorial, we discuss two main algorithms for Hidden Markov Models or HMMs: the Viterbi algorithm and the expectation phase of the Baum–Welch algorithm, and we describe ways to improve their naïve implementations. For the Baum–Welch algorithm we first present an implementation of the expectation computations using constant space. We then discuss the classical implementation of this calculation and describe ways to reduce its space usage to logarithmic and [Formula: see text], with their respective CPU costs. We also note where each respective algorithm can be parallelized. For the Viterbi algorithm, we describe [Formula: see text] and logarithmic space algorithms which increase CPU use by a factor of two and by a logarithmic factor respectively. We also present two recent heuristics for decreasing space use, which in practice lead to logarithmic space use. Classical version of Viterbi cannot be parallelized by splitting sequence in several subsequences, but we show a parallelization that works if we are willing to pay a significant extra CPU cost. Finally we show a very simple parallelization trick which enables full usage of multiple CPUs/cores under the condition that they share memory.

APA, Harvard, Vancouver, ISO, and other styles

7

Ann Wen, Kuei, and Jau Yien Lee. "Parallel processing for Viterbi algorithm." Electronics Letters 24, no. 17 (1988): 1098. http://dx.doi.org/10.1049/el:19880745.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Wei, L. "Iterative Viterbi Algorithm: Implementation Issues." IEEE Transactions on Wireless Communications 3, no. 2 (March 2004): 382–86. http://dx.doi.org/10.1109/twc.2003.821149.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

FOREMAN, LINDSEY A. "Generalisation of the Viterbi algorithm." IMA Journal of Management Mathematics 4, no. 4 (1992): 351–67. http://dx.doi.org/10.1093/imaman/4.4.351.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Reeve, J. S. "A parallel Viterbi decoding algorithm." Concurrency and Computation: Practice and Experience 13, no. 2 (2001): 95–102. http://dx.doi.org/10.1002/cpe.539.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Yin, Yibo, Kainan Ma, and Ming Liu. "Temporal Convolutional Network Connected with an Anti-Arrhythmia Hidden Semi-Markov Model for Heart Sound Segmentation." Applied Sciences 10, no. 20 (October 11, 2020): 7049. http://dx.doi.org/10.3390/app10207049.

Full text

Abstract:

Heart sound segmentation (HSS) is a critical step in heart sound processing, where it improves the interpretability of heart sound disease classification algorithms. In this study, we aimed to develop a real-time algorithm for HSS by combining the temporal convolutional network (TCN) and the hidden semi-Markov model (HSMM), and improve the performance of HSMM for heart sounds with arrhythmias. We experimented with TCN and determined the best parameters based on spectral features, envelopes, and one-dimensional CNN. However, the TCN results could contradict the natural fixed order of S1-systolic-S2-diastolic of heart sound, and thereby the Viterbi algorithm based on HSMM was connected to correct the order errors. On this basis, we improved the performance of the Viterbi algorithm when detecting heart sounds with cardiac arrhythmias by changing the distribution and weights of the state duration probabilities. The public PhysioNet Computing in Cardiology Challenge 2016 data set was employed to evaluate the performance of the proposed algorithm. The proposed algorithm achieved an F1 score of 97.02%, and this result was comparable with the current state-of-the-art segmentation algorithms. In addition, the proposed enhanced Viterbi algorithm for HSMM corrected 30 out of 30 arrhythmia errors after checking one by one in the dataset.

APA, Harvard, Vancouver, ISO, and other styles

12

Jin, Yuzi. "The Optimization of the Dynamic Mechanism of Jilin’s Economic Revitalization from the Perspective of Viterbi Algorithm’s Supply-Side Structural Reform." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 28, Supp02 (December 2020): 111–22. http://dx.doi.org/10.1142/s0218488520400188.

Full text

Abstract:

Under the background of the rapid development of the Internet, the development information and social status that affect economic regeneration exist in the form of literal data in massive data information. The use of Viterbi algorithm can establish a digital model of information extraction, so as to quickly and accurately find the important content information in the Internet that influences the development of reform and economic rejuvenation. Therefore, based on the Viterbi algorithm, the use of mathematical models to help Jilin economic mechanism research from qualitative to quantitative, and continuously improve the scientific level of economic research. After deep analysis of the implementation principle and algorithm flow of Viterbi algorithm, and from the need of text information extraction, an optimization and update scheme is proposed to improve the effectiveness of the algorithm and the accuracy is calculated effectively based on the word feature detection. After simulation experiments show that Viterbi algorithm has a good application value in the field of Jilin economic reform research.

APA, Harvard, Vancouver, ISO, and other styles

13

Liu, Xia, Fei Long, Wenjie Zhang, and Lu Guo. "Modular Interacting Multiple Model Based on Extended Viterbi Algorithm for Maneuvering Target Tracking." Mathematical Problems in Engineering 2015 (2015): 1–6. http://dx.doi.org/10.1155/2015/374054.

Full text

Abstract:

A new maneuvering target tracking algorithm is investigated, which is modeled as a class of Markov jump linear systems (MJLS). Drawing on the experience of combination idea of the extended Viterbi algorithm (EV) and the interacting multiple model algorithm (IMM), a modular interacting multiple model based on extended Viterbi (MIMMEV) is presented. The MIMMEV algorithm consists ofNindependent interacting multiple model-extended Viterbi (IMM-EV). Furthermore, these IMM-EV filters are independent and working in parallel in the MIMMEV algorithm. According to the derived probability, the estimated state of every moment is the weighted sum of each estimator at the corresponding time. Simulation results demonstrate that the proposed algorithm improves the tracking precision and reduces the computational burden compared with traditional IMM and IMM-EV.

APA, Harvard, Vancouver, ISO, and other styles

14

Minh Quang, Nguyen. "VITERBI ALGORITHM FOR ENGLISH - VIETNAMESE SENTENCE RETRIEVAL IN EBMT." Journal of Science, Educational Science 60, no. 7A (2015): 3–9. http://dx.doi.org/10.18173/2354-1075.2015-0047.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Matczak, Grzegorz, and Przemyslaw Mazurek. "History Dependent Viterbi Algorithm for Navigation Purposes of Line Following Robot." Image Processing & Communications 20, no. 4 (December 1, 2015): 5–11. http://dx.doi.org/10.1515/ipc-2015-0039.

Full text

Abstract:

Abstract Line following robots are applied in numerous applications and the best performance could be obtained if the forward looking camera is applied. Variable light and line conditions influence the line estimation and quality of the robot navigation. Proposed History Dependent Viterbi Algorithm and Viterbi Algorithm are compared. Obtained results using Monte Carlo tests show improved performance of the proposed algorithm for assumed model.

APA, Harvard, Vancouver, ISO, and other styles

16

Kahina, Rekkal, and Abdesselam Bassou. "Improving the Performance of Viterbi Decoder using Window System." International Journal of Electrical and Computer Engineering (IJECE) 8, no. 1 (February 1, 2018): 611. http://dx.doi.org/10.11591/ijece.v8i1.pp611-621.

Full text

Abstract:

An efficient Viterbi decoder is introduced in this paper; it is called Viterbi decoder with window system. The simulation results, over Gaussian channels, are performed from rate 1/2, 1/3 and 2/3 joined to TCM encoder with memory in order of 2, 3. These results show that the proposed scheme outperforms the classical Viterbi by a gain of 1 dB. On the other hand, we propose a function called RSCPOLY2TRELLIS, for recursive systematic convolutional (RSC) encoder which creates the trellis structure of a recursive systematic convolutional encoder from the matrix “H”. Moreover, we present a comparison between the decoding algorithms of the TCM encoder like Viterbi soft and hard, and the variants of the MAP decoder known as BCJR or forward-backward algorithm which is very performant in decoding TCM, but depends on the size of the code, the memory, and the CPU requirements of the application.

APA, Harvard, Vancouver, ISO, and other styles

17

Wang, Haocheng, Yafeng Wang, and Yue Hu. "Bidirectional Viterbi decoding algorithm for OvTDM." China Communications 17, no. 7 (July 2020): 183–92. http://dx.doi.org/10.23919/j.cc.2020.07.013.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Bouloutas, A., G. W. Hart, and M. Schwartz. "Two extensions of the Viterbi algorithm." IEEE Transactions on Information Theory 37, no. 2 (March 1991): 430–36. http://dx.doi.org/10.1109/18.75270.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Benvenuto, N., and R. Marchesani. "The Viterbi algorithm for sparse channels." IEEE Transactions on Communications 44, no. 3 (March 1996): 287–89. http://dx.doi.org/10.1109/26.486320.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Maymon, Shay, and Yonina C. Eldar. "The Viterbi Algorithm for Subset Selection." IEEE Signal Processing Letters 22, no. 5 (May 2015): 524–28. http://dx.doi.org/10.1109/lsp.2014.2360881.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Schlegel, C. B., and M. A. Herro. "A burst-error-correcting Viterbi algorithm." IEEE Transactions on Communications 38, no. 3 (March 1990): 285–91. http://dx.doi.org/10.1109/26.48885.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Miller, Casey, Bobby R. Hunt, Michael W. Marcellin, and Mark A. Neifeld. "Image restoration with the Viterbi algorithm." Journal of the Optical Society of America A 17, no. 2 (February 1, 2000): 265. http://dx.doi.org/10.1364/josaa.17.000265.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Aftelak, S. B., and A. P. Clark. "Adaptive reduced-state Viterbi algorithm detector." Journal of the Institution of Electronic and Radio Engineers 56, no. 5 (1986): 197. http://dx.doi.org/10.1049/jiere.1986.0079.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Turin, W. "Union Bounds on Viterbi Algorithm Performance." AT&T Technical Journal 64, no. 10 (December 1985): 2375–85. http://dx.doi.org/10.1002/j.1538-7305.1985.tb00008.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Xie, Qiwei, Qian Long, and Seiichi Mita. "Integration of optical flow and Multi-Path-Viterbi algorithm for stereo vision." International Journal of Wavelets, Multiresolution and Information Processing 15, no. 03 (February 16, 2017): 1750022. http://dx.doi.org/10.1142/s0219691317500229.

Full text

Abstract:

This paper proposes a novel stereo matching algorithm to solve environment sensing problems. It integrates a non-convex optical flow and Viterbi process. The non-convex optical flow employs a new adaptive weighted non-convex Total Generalized Variation (TGV) model, which can obtain sharp disparity maps. Structural similarity, total variation constraint, and a specific merging strategy are combined with the 4 bi-directional Viterbi process to improve the robustness. In the fusion of the optical flow and Viterbi process, a new occlusion processing method is incorporated in order to get more sharp disparity and more robust result. Extensive experiments are conducted to compare this algorithm with other state-of-the-art methods. Experimental results show the superiority of our algorithm.

APA, Harvard, Vancouver, ISO, and other styles

26

Shi, Xiaoxiao. "A Method of Optimizing Network Topology Structure Combining Viterbi Algorithm and Bayesian Algorithm." Wireless Communications and Mobile Computing 2021 (May 8, 2021): 1–12. http://dx.doi.org/10.1155/2021/5513349.

Full text

Abstract:

With Internet entering all walks of life, development of internet and usage expansion demand better performance, especially the application of 5G network that adopts NAS networking mode. Some of the network bandwidth cannot fully support the current network demand, which causes network fluctuations and other concerns. In this paper, a method for optimizing the topological structure of the bottom layer of the communication network is proposed that has outage performance close to optimal routing scheme. In specific, path in areas with poor network conditions is first optimized using Viterbi algorithm. Then, network element nodes on the path are optimized using Bayes recommendation algorithm for reasonable flow distribution. Dual planning of improved Viterbi algorithm is used to realize the main and standby path planning, and then, Bayesian recommendation algorithm based on the average value is used to optimize the network elements. Therefore, it is very efficient to realize overall performance optimization.

APA, Harvard, Vancouver, ISO, and other styles

27

Kumar, Ghanendra, and Chakres Kumar. "Effect of NAVA for Dense Optical Communication System." Science & Technology Journal 7, no. 1 (January 1, 2019): 78–81. http://dx.doi.org/10.22232/stj.2019.07.01.10.

Full text

Abstract:

Viterbi Algorithm (VA) is basically an algorithm that is implemented for the detection & estimation of a sequence of symbols in digital communication and signal processing. It calculates a survivor path with minimum metric value, but cannot detect any error. The VA is scrutinized to upgrade the transmission process and provide the plate form in terms of the existence, linear phase noise as well as non-linear phase noise. In contradiction to non-adaptive MLSD (Maximum Likelihood Sequence Detection), the Viterbi algorithm renders the exemplary performance.

APA, Harvard, Vancouver, ISO, and other styles

28

Trogh, Jens, David Plets, Luc Martens, and Wout Joseph. "Advanced Real-Time Indoor Tracking Based on the Viterbi Algorithm and Semantic Data." International Journal of Distributed Sensor Networks 2015 (2015): 1–11. http://dx.doi.org/10.1155/2015/271818.

Full text

Abstract:

A real-time indoor tracking system based on the Viterbi algorithm is developed. This Viterbi principle is used in combination with semantic data to improve the accuracy, that is, the environment of the object that is being tracked and a motion model. The starting point is a fingerprinting technique for which an advanced network planner is used to automatically construct the radio map, avoiding a time consuming measurement campaign. The developed algorithm was verified with simulations and with experiments in a building-wide testbed for sensor experiments, where a median accuracy below 2 m was obtained. Compared to a reference algorithm without Viterbi or semantic data, the results indicated a significant improvement: the mean accuracy and standard deviation improved by, respectively, 26.1% and 65.3%. Thereafter a sensitivity analysis was conducted to estimate the influence of node density, grid size, memory usage, and semantic data on the performance.

APA, Harvard, Vancouver, ISO, and other styles

29

Lu, Ying, Quan Yuan Xu, and Zhi Gang Liu. "Realization of the Viterbi Algorithm in MLSE with Intersymbol Interference." Applied Mechanics and Materials 214 (November 2012): 208–12. http://dx.doi.org/10.4028/www.scientific.net/amm.214.208.

Full text

Abstract:

Optimum receiver model for channels with Intersymbol Interference (ISI) and Additive White Gaussian Noise (AWGN) are introduced to deduce the Viterbi algorithm in the Maximum-Likelihood Sequence Estimation (MLSE). Finally, we use Matlab to simulate the algorithm in three different channels and analyze the experiment results. Analyses show that the Viterbi algorithm is applicable for any channel which is optimum from a probability of error viewpoint; the MLSE for channels with ISI has a computational complexity that grows exponentially with the length of channels time dispersion L; the loss of performance is negligible when the decoding delay achieves 5L.

APA, Harvard, Vancouver, ISO, and other styles

30

Yoon, Sang-Hun, and Jun-Mo Jung. "Viterbi-based Decoding Algorithm for DBO-CSS." Journal of information and communication convergence engineering 9, no. 6 (December 31, 2011): 657–60. http://dx.doi.org/10.6109/ijice.2011.9.6.657.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Zolotarev, V. V. "EXPANDING POSSIBILITIES TO APPLY BLOCK VITERBI ALGORITHM." Vestnik of Ryazan State Radio Engineering University 74 (2020): 34–41. http://dx.doi.org/10.21667/1995-4565-2020-74-34-41.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

ZHAO, Xiaoping. "Gabor Order Tracking Based on Viterbi Algorithm." Journal of Mechanical Engineering 45, no. 11 (2009): 247. http://dx.doi.org/10.3901/jme.2009.11.247.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Kavcic, A., and J. M. F. Moura. "The Viterbi algorithm and Markov noise memory." IEEE Transactions on Information Theory 46, no. 1 (2000): 291–301. http://dx.doi.org/10.1109/18.817531.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Chang, C. Y., and K. Yao. "Systolic array processing of the Viterbi algorithm." IEEE Transactions on Information Theory 35, no. 1 (1989): 76–86. http://dx.doi.org/10.1109/18.42179.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

McGinty, N. C., R. A. Kennedy, and P. Hocher. "Parallel trellis Viterbi algorithm for sparse channels." IEEE Communications Letters 2, no. 5 (May 1998): 143–45. http://dx.doi.org/10.1109/4234.673661.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Enns, Russell, and Darryl Morrell. "Terrain-aided navigation using the Viterbi algorithm." Journal of Guidance, Control, and Dynamics 18, no. 6 (November 1995): 1444–49. http://dx.doi.org/10.2514/3.21566.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Chong-Yung Chi and J. Mendel. "Viterbi algorithm detector for Bernoulli-Gaussian processes." IEEE Transactions on Acoustics, Speech, and Signal Processing 33, no. 3 (June 1985): 511–19. http://dx.doi.org/10.1109/tassp.1985.1164580.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Abbasfar, A., and K. Yao. "Survivor memory reduction in the Viterbi algorithm." IEEE Communications Letters 9, no. 4 (2005): 352–54. http://dx.doi.org/10.1109/lcomm.2005.04004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Abbasfar, A., and Kung Yao. "Survivor memory reduction in the viterbi algorithm." IEEE Communications Letters 9, no. 4 (April 2005): 352–54. http://dx.doi.org/10.1109/lcomm.2005.1413631.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Kuei-Ann Wen, Ting-Shiun Wen, and Jhing-Fa Wang. "A new transform algorithm for Viterbi decoding." IEEE Transactions on Communications 38, no. 6 (June 1990): 764–72. http://dx.doi.org/10.1109/26.57468.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Qi Wang and Lei Wei. "Iterative Viterbi algorithm for concatenated multidimensional TCM." IEEE Transactions on Communications 50, no. 1 (2002): 12–15. http://dx.doi.org/10.1109/26.975736.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Nohre, Ragnar. "Deformed template matching by the Viterbi algorithm." Pattern Recognition Letters 17, no. 14 (December 1996): 1423–28. http://dx.doi.org/10.1016/s0167-8655(96)00107-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Viterbi, A. J. "A personal history of the Viterbi algorithm." IEEE Signal Processing Magazine 23, no. 4 (July 2006): 120–42. http://dx.doi.org/10.1109/msp.2006.1657823.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Vasudevan, K., K. Giridhar, and B. Ramamurthi. "Efficient Viterbi algorithm for signals with ISI." Electronics Letters 34, no. 7 (1998): 629. http://dx.doi.org/10.1049/el:19980472.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Hanif, Muhammad Kashif, and Karl-Heinz Zimmermann. "Accelerating Viterbi algorithm on graphics processing units." Computing 99, no. 11 (May 19, 2017): 1105–23. http://dx.doi.org/10.1007/s00607-017-0557-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Lember, Jüri, and Alexey Koloydenko. "ADJUSTED VITERBI TRAINING." Probability in the Engineering and Informational Sciences 21, no. 3 (July 2007): 451–75. http://dx.doi.org/10.1017/s0269964807000083.

Full text

Abstract:

Viterbi training (VT) provides a fast but inconsistent estimator of hidden Markov models (HMM). The inconsistency is alleviated with a little extra computation when we enable VT to asymptotically fix the true values of the parameters. This relies on infinite Viterbi alignments and associated with them limiting probability distributions. First in a sequel, this article is a proof of concept; it focuses on mixture models, an important but special case of HMM where the limiting distributions can be calculated exactly. A simulated Gaussian mixture shows that our central algorithm (VA1) can significantly improve the accuracy of VT with little extra cost. Next in the sequel, we present elsewhere a theory of the adjusted VT for the general HMMs, where the limiting distributions are more challenging to find. Here, we also present another, more advanced correction to VT and verify its fast convergence and high accuracy; its computational feasibility requires additional investigation.

APA, Harvard, Vancouver, ISO, and other styles

47

Han, Ke, Zhong Liang Deng, and Lian Ming Xu. "The Viterbi Decoding Scheme for FPGA." Applied Mechanics and Materials 63-64 (June 2011): 835–40. http://dx.doi.org/10.4028/www.scientific.net/amm.63-64.835.

Full text

Abstract:

This paper analyzes the principle of Viterbi algorithm which can be used in the norm of the mobile communication system. Then a new Viterbi decoding scheme of (2, 1, 7) convolutional code is presented for FPGA implementation. To take advantage of the FPGA, a new branch weight algorithm and uniform state weight memories is used. At last, a new decoding circuit which can work on 35MHz and can achieve 120 kbs in decoding speed was designed. To use the design of survival path exchange register module, it can decrease the power consumption and the RAM size.

APA, Harvard, Vancouver, ISO, and other styles

48

Koloydenko, Alexey, and Jüri Lember. "Infinite Viterbi alignments in the two state hidden Markov models." Acta et Commentationes Universitatis Tartuensis de Mathematica 12 (December 31, 2008): 109–24. http://dx.doi.org/10.12697/acutm.2008.12.10.

Full text

Abstract:

Since the early days of digital communication, hidden Markov models (HMMs) have now been routinely used in speech recognition, processing of natural languages, images, and in bioinformatics. An HMM (Xi, Yi)i≥1 assumes observations X1, X2, . . . to be conditionally independent given an “explanatary” Markov process Y1, Y2, . . ., which itself is not observed; moreover, the conditional distribution of Xi depends solely on Yi. Central to the theory and applications of HMM is the Viterbi algorithm to find a maximum a posteriori estimate q1:n = (q1, q2, . . . , qn) of Y1:n given the observed data x1:n. Maximum a posteriori paths are also called Viterbi paths or alignments. Recently, attempts have been made to study the behavior of Viterbi alignments of HMMs with two hidden states when n tends to infinity. It has indeed been shown that in some special cases a well-defined limiting Viterbi alignment exists. While innovative, these attempts have relied on rather strong assumptions. This work proves the existence of infinite Viterbi alignments for virtually any HMM with two hidden states.

APA, Harvard, Vancouver, ISO, and other styles

49

Eusse, Juan Fernando, Nahri Moreano, Alba Cristina Magalhaes Alves de Melo, and Ricardo Pezzuol Jacobi. "A Protein Sequence Analysis Hardware Accelerator Based on Divergences." International Journal of Reconfigurable Computing 2012 (2012): 1–19. http://dx.doi.org/10.1155/2012/201378.

Full text

Abstract:

The Viterbi algorithm is one of the most used dynamic programming algorithms for protein comparison and identification, based on hidden markov Models (HMMs). Most of the works in the literature focus on the implementation of hardware accelerators that act as a prefilter stage in the comparison process. This stage discards poorly aligned sequences with a low similarity score and forwards sequences with good similarity scores to software, where they are reprocessed to generate the sequence alignment. In order to reduce the software reprocessing time, this work proposes a hardware accelerator for the Viterbi algorithm which includes the concept of divergence, in which the region of interest of the dynamic programming matrices is delimited. We obtained gains of up to 182x when compared to unaccelerated software. The performance measurement methodology adopted in this work takes into account not only the acceleration achieved by the hardware but also the reprocessing software stage required to generate the alignment.

APA, Harvard, Vancouver, ISO, and other styles

50

Joseph, Thobius, Herbert Peter Wanga, Frank Samson, and Shangweli Vyosena Kituma. "Prototype for Multimedia Content Delivery based on Non-Transmittable Codewords Enhanced Viterbi Algorithm." International Journal of Engineering and Applied Computer Science 04, no. 04 (June 3, 2022): 41–46. http://dx.doi.org/10.24032/ijeacs/0404/010.

Full text

Abstract:

The paper provides a prototype for multimedia content delivery with reduced channel code rate from conventional Non-Transmittable Codewords Enhanced Viterbi Algorithm. The code rate reduction was simulated using VB.NET Viterbi simulator available at College of Informatics and Virtual Education-University of Dodoma. The study approximates Uplink and downlink speeds limits of the prototype using High Speed Packet Access Evolved technology by assuming all other parameters remain constant. The uplink and downlink of the prototype is clearly presented. The code rate of 1/3 was obtained by simulating different 8-bits patterns. This code rate of 1/3 enabled reduction of encoder output bits from 48-bits to 24-bits, therefore, few bits would be sent to the network and bandwidth conservation is attained. This makes the prototype to be the good choice for low network bandwidth channel. In addition, the reduced code rate will reduce the expenses of user internet bundles, because number of MBs to be charged will be smaller. This prototype for multimedia delivery over network has three benefits, high data transmission reliability due to adopted NTC Enhanced Viterbi, minimum network bandwidth utilization and satisfied uplink and downlink access speed.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!