Parallel WFST Token Propagation for Low-Latency ASR
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Automatic speech recognition (ASR) systems on small devices face challenges due to computational complexity and power constraints, leading to delayed and low-quality word recognition, as existing solutions like GPU-based decoding are not feasible for all devices and SIMD parallelization is inefficient due to conditional branching and scattered memory access.
Innovation Solution
The implementation of two-part decoding using parallel processing of equivalent sub-graphs within a Weighted Finite State Transducer (WFST) framework, where sub-graphs are updated in parallel using SIMD instructions like SSE or AVX, allowing for efficient token propagation without altering the WFST structure, thereby enabling ASR on smaller platforms with reduced power consumption.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If server-based ASR computations are performed remotely, then word recognition quality is improved, but response delay increases
Solution Approach 1:
The ASR system is segmented into client-side components (acoustic model, feature extraction) and server-side components (language model, vocabulary), allowing critical path computations to occur locally while maintaining recognition quality through distributed processing
Solution Approach 2:
The patent transitions from a single-dimension server-client model to a multi-dimensional hybrid architecture where different computational tasks are distributed across different dimensions (local device resources vs. remote server resources), enabling simultaneous local preprocessing and remote language modeling
2Loss of time
If on-board ASR computation is implemented on small devices, then response delay is reduced, but power consumption increases
Solution Approach 1:
The device performs partial ASR computations locally (acoustic scoring, feature extraction) rather than complete processing, sending only intermediate results to the server for language modeling and final decoding, thus reducing local power consumption while maintaining fast response
Solution Approach 2:
The system dynamically adjusts computation parameters such as acoustic model complexity, vocabulary size, and decoding depth based on available power resources and performance requirements, optimizing the balance between speed and energy consumption
3Device complexity
If traditional sequential WFST decoding is used, then implementation simplicity is maintained, but processing speed decreases
Solution Approach 1:
The WFST decoding process is segmented into independent parallelizable operations (token propagation, score computation, path exploration) that can be executed concurrently using multi-threading and vectorization techniques while maintaining the overall decoding logic
Solution Approach 2:
Multiple decoding paths and candidate hypotheses are merged and processed simultaneously using beam search with parallel score computation, combining the exploration of multiple hypotheses with efficient resource utilization to increase processing throughput
4Productivity
If GPU-based decoding is implemented, then processing speed is improved, but device compatibility and power efficiency worsen
Solution Approach 1:
The patent implements a universal decoding framework that can operate on various hardware platforms (CPU, GPU, FPGA, mobile processors) by abstracting computation kernels and providing platform-specific optimizations, making the system adaptable to different device types without requiring GPU hardware
Solution Approach 2:
The system replaces specialized GPU hardware acceleration with software-based parallel processing techniques (SIMD instructions, multi-threading, vectorized operations) that can run on general-purpose processors, eliminating the need for dedicated graphics hardware while maintaining improved processing speed
Data Source
AI summary
A computer-implemented method of speech recognition comprises forming a weighted finite state transducer (WFST) having nodes associated with states and interconnected by arcs, and to identify at least one word or word sequence hypothesis, identifying multiple sub-graphs on the WFST, each sub-graph having the same arrangement of multiple states and at least one arc, and propagating tokens in parallel through the sub-graphs, where each sub-graph is stored as a supertoken each having an array of tokens.


