On the Ramsey Class of Interleavers for Robust Speech Recognition in Burst-Like Packet Loss

This paper focuses on the application of the Ramsey class of interleavers to the problem of achieving robust distributed speech recognition in the presence of burst-like packet loss. Although block interleavers of minimal latency have been already proposed by other authors in order to cope with this problem, the Ramsey class offers a more powerful kind of interleavers. Taking into account the behavior of the error concealment techniques commonly used in these recognition systems, it is possible to design Ramsey interleavers which, in comparison with the block interleavers of minimal latency, can counteract longer bursts with the same latency and thus improve the robustness of the recognition system. The effectiveness of the proposed design criterion is verified by means of simulations and experimental comparisons

[1]  D. Pearce.  Enabling new speech driven services for mobile devices: an overview of the proposed etsi standard for a distributed speech recognition front-end , 1999 .

[2]  José L. Pérez-Córdoba,et al.  Efficient MMSE-based channel error mitigation techniques. Application to distributed speech recognition over wireless channels , 2005, IEEE Transactions on Wireless Communications.

[3]  Carmen Peláez-Moreno,et al.  A comparison of front-ends for bitstream-based ASR over IP , 2006, Signal Process..

[4]  David Pearce,et al.  The aurora experimental framework for the performance evaluation of speech recognition systems under noisy conditions , 2000, INTERSPEECH.

[5]  Donald F. Towsley,et al.  Measurement and modelling of the temporal dependence in packet loss , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[6]  Roberto Garello,et al.  Interleaver properties and their applications to the trellis complexity analysis of turbo codes , 2001, IEEE Trans. Commun..

[7]  Ben P. Milner,et al.  Analysis and compensation of packet loss in distributed speech recognition using interleaving , 2003, INTERSPEECH.

[8]  John L. Ramsey.  Realization of optimum interleavers , 1970, IEEE Trans. Inf. Theory.

[9]  V. Hardman,et al.  A survey of packet loss recovery techniques for streaming audio , 1998, IEEE Network.

[10]  Ben P. Milner,et al.  Robust speech recognition over mobile and IP networks in burst-like packet loss , 2006, IEEE Transactions on Audio, Speech, and Language Processing.

[11]  Chris Heegard,et al.  A Theory of Interleavers , 1997 .

[12]  Ángel M. Gómez,et al.  A source model mitigation technique for distributed speech recognition over lossy packet channels , 2003, INTERSPEECH.

[13]  Ben P. Milner,et al.  An analysis of interleavers for robust speech recognition in burst-like packet loss , 2004, 2004 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[14]  Jean-Chrysostome Bolot,et al.  End-to-end packet delay and loss behavior in the internet , 1993, SIGCOMM '93.

[15]  Georg Carle,et al.  Framework model for packet loss metrics based on loss runlengths , 1999, Electronic Imaging.

[16]  Darren Pearce,et al.  Enabling new speech driven services for mobile devices: An overview of the ETSI standards activities , 2000 .

[17]  Wenyu Jiang,et al.  Modeling of Packet Loss and Delay and Their Effect on Real-Time Multimedia Service Quality , 2000 .

[18]  Angel Manuel Gomez,et al.  A comparison of packet loss compensation methods and interleaving for speech recognition in burst-like packet loss , 2004, INTERSPEECH.