kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
SIEVE: A Space-Efficient Algorithm for Viterbi Decoding
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science, Theoretical Computer Science, TCS.ORCID iD: 0000-0002-5211-112X
2022 (English)In: SIGMOD '22: Proceedings of the 2022 International Conference on Management of Data, Association for Computing Machinery (ACM) , 2022, p. 1136-1145Conference paper, Published paper (Refereed)
Abstract [en]

Can we get speech recognition tools to work on limited-memory devices? The Viterbi algorithm is a classic dynamic programming (DP) solution used to find the most likely sequence of hidden states in a Hidden Markov Model (HMM). While the algorithm finds universal application ranging from communication systems to speech recognition to bioinformatics, its scalability has been scarcely addressed, stranding it to a space complexity that grows with the number of observations. In this paper, we propose SIEVE (Space Efficient Viterbi), a reformulation of the Viterbi algorithm that eliminates its space-complexity dependence on the number of observations to be explained. SIEVE discards and recomputes parts of the DP solution for the sake of space efficiency, in divide-and-conquer fashion, without incurring a time-complexity overhead. Our thorough experimental evaluation shows that SIEVE is highly effective in reducing the memory usage compared to the classic Viterbi algorithm, while avoiding the runtime overhead of a naïve space-efficient solution.

Place, publisher, year, edition, pages
Association for Computing Machinery (ACM) , 2022. p. 1136-1145
Series
Proceedings of the ACM SIGMOD International Conference on Management of Data, ISSN 0730-8078
Keywords [en]
divide-and-conquer, space efficiency, viterbi decoding
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-317105DOI: 10.1145/3514221.3526170ISI: 000852705400083Scopus ID: 2-s2.0-85132695191OAI: oai:DiVA.org:kth-317105DiVA, id: diva2:1693185
Conference
2022 ACM SIGMOD International Conference on the Management of Data, SIGMOD 2022, 12-17 June 2022, Virtual, Online
Note

Part of proceedings: ISBN 978-145039249-5

QC 20220906

Available from: 2022-09-06 Created: 2022-09-06 Last updated: 2025-01-27Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Gionis, Aristides

Search in DiVA

By author/editor
Gionis, Aristides
By organisation
Theoretical Computer Science, TCS
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 97 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf