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