Packet loss presents a significant problem for distributed speech recognition systems particularly when burst lengths of loss are long. This work first proposes an extension to convolutional interleavers such that bursts of packet loss are maximally dispersed to minimise the duration of bursts of loss in the received feature vector stream. This is achieved by interleaving each dimension of the feature vector stream separately. This is shown to give significant gains in recognition accuracy on a large vocabulary task, although at theexpense of increased delay. The second part of this work shows how the interleaving delay can be absorbed into the hang-over delay used to determine when a speaker has finished talking in speech recognition applications.
Cite as: James, A., Milner, B. (2005) A comparison of efficient interleaver designs for real time distributed speech recognition. Proc. Applied Spoken Language Interaction in Distributed Environments (ASIDE 2005), paper 27
@inproceedings{james05_aside,
author={Alastair James and Ben Milner},
title={{A comparison of efficient interleaver designs for real time distributed speech recognition}},
year=2005,
booktitle={Proc. Applied Spoken Language Interaction in Distributed Environments (ASIDE 2005)},
pages={paper 27}
}