FLASH Viterbi: Fast and Adaptive Viterbi Decoding for Modern Data Systems
Ziheng Deng, Xue Liu, Jiantong Jiang, Yankai Li, Qingxu Deng, Xiaochun Yang

TL;DR
FLASH Viterbi introduces a fast, adaptive, and resource-efficient decoding algorithm suitable for modern data systems and edge devices, combining divide-and-conquer, pruning, and hardware acceleration.
Contribution
It proposes a novel, adaptive Viterbi decoding method with a hardware-friendly design, improving speed and memory efficiency over existing approaches.
Findings
Outperforms baseline algorithms in decoding time
Reduces memory usage significantly
Demonstrates high throughput on FPGA hardware
Abstract
The Viterbi algorithm is a key operator for structured sequence inference in modern data systems, with applications in trajectory analysis, online recommendation, and speech recognition. As these workloads increasingly migrate to resource-constrained edge platforms, standard Viterbi decoding remains memory-intensive and computationally inflexible. Existing methods typically trade decoding time for space efficiency, but often incur significant runtime overhead and lack adaptability to various system constraints. This paper presents FLASH Viterbi, a Fast, Lightweight, Adaptive, and Hardware-Friendly Viterbi decoding operator that enhances adaptability and resource efficiency. FLASH Viterbi combines a non-recursive divide-and-conquer strategy with pruning and parallelization techniques to enhance both time and memory efficiency, making it well-suited for resource-constrained data systems.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Data Management and Algorithms · Time Series Analysis and Forecasting
