On The Temporal Parallelisation of The Viterbi Algorithm

Simo Särkkä, Angel F. García-Fernández

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

1 Citation (Scopus)
28 Downloads (Pure)

Abstract

This paper presents an algorithm to parallelise the Viterbi algorithm along the temporal dimension to compute the maximum a posteriori (MAP) trajectory estimate of a hidden Markov model. We reformulate the MAP estimation problem as an optimal control problem. The proposed algorithm uses a parallelisation algorithm developed for optimal control problems that first performs a backward value function pass and then a forward trajectory recovery pass. The parallel Viterbi algorithm then corresponds to a specialised backward optimal control problem with a forward value function pass and backward MAP-trajectory recovery pass. The algorithm is empirically tested by running numerical simulations on a multi-core central processing unit (CPU) and a graphics processing unit (GPU).

Original languageEnglish
Title of host publication31st European Signal Processing Conference, EUSIPCO 2023 - Proceedings
PublisherEuropean Association For Signal and Image Processing
Pages2018-2022
Number of pages5
ISBN (Electronic)978-94-645936-0-0
DOIs
Publication statusPublished - 1 Nov 2023
MoE publication typeA4 Conference publication
EventEuropean Signal Processing Conference - Helsinki, Finland
Duration: 4 Sept 20238 Sept 2023
Conference number: 31
https://eusipco2023.org/

Publication series

NameEuropean Signal Processing Conference
ISSN (Print)2219-5491

Conference

ConferenceEuropean Signal Processing Conference
Abbreviated titleEUSIPCO
Country/TerritoryFinland
CityHelsinki
Period04/09/202308/09/2023
Internet address

Keywords

  • hidden Markov model
  • maximum a posteriori estimation
  • temporal parallelisation
  • Viterbi algorithm

Fingerprint

Dive into the research topics of 'On The Temporal Parallelisation of The Viterbi Algorithm'. Together they form a unique fingerprint.

Cite this