Accelerating Viterbi algorithm on graphics processing units
DOI10.1007/S00607-017-0557-6zbMATH Open1430.68434DBLPjournals/computing/HanifZ17OpenAlexW2616045668WikidataQ60204442 ScholiaQ60204442MaRDI QIDQ1700985FDOQ1700985
Karl-Heinz Zimmermann, Muhammad Kashif Hanif
Publication date: 22 February 2018
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-017-0557-6
Recommendations
- An efficient cache-oblivious parallel Viterbi algorithm
- scientific article; zbMATH DE number 484156
- A coarse-to-fine approach to computing the \(k\)-best Viterbi paths
- Efficient computing methods for parallel processing: An implementation of the Viterbi algorithm
- An efficient parallel algorithm for list Viterbi decoding
Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Dynamic programming (90C39) Parallel algorithms in computer science (68W10)
Cites Work
- Biological Sequence Analysis
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Algebraic Statistics for Computational Biology
- Gaussian elimination is not optimal
- Matrix multiplication via arithmetic progressions
- More algorithms for all-pairs shortest paths in weighted graphs
- Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
- Speeding up HMM decoding and training by exploiting sequence repetitions
- Markov models for pattern recognition. From theory to applications.
Uses Software
This page was built for publication: Accelerating Viterbi algorithm on graphics processing units
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1700985)
