Increased Robustness Against Bit Errors for Distributed Speech Recognition in Wireless Environments
Brian Delaney · 2006
In distributed speech recognition, the speech features are computed on a mobile device, compressed, and sent over a network to a speech recognition server, where the Viterbi search and hidden Markov modeling take place. We examine some error concealment methods for distributed speech recognition over burst error channels. We consider interpolation and interleaving, and we present a novel use of the stochastic weighted Viterbi recognition algorithm to increase robustness against interpolated features. We examine interleaving at both the frame level and codebook index level. Channel errors are simulated using a Gilbert model, and the performance of our algorithm is compared with other techniques, including the ETSI DSR standard, on a digits task and a large vocabulary task. Coupled with interleaving and interpolation, our algorithm can provide accuracy as high as 96.7% on a digit recognition task during an average bit error probability of 1/20. On the more difficult WSJ task, the accuracy without bit errors is 85.7%. Using our algorithm, we can achieve 82.9% accuracy with an average bit error probability of 1/30.