A systolic algorithm for connected word recognition

A systolic algorithm for connected word recognition (CWR) using dynamic time warping (DTW)Qtechnique is described. The algorithm relies upon an iterative method for finding the sequence of connected words that minimizes DTW distance to a given utterance. This method allows simultaneous computation of the best connected word sequence regardless of its number of words. A parallel implementation of the method is also proposed. Basically it uses a linear network of identical very simple processors. It is also explained how this network may be connected to a recently proposed DTW net-word implementing DTW algorithm. The machine resulting from this interconnection constitutes a highly parallel connected word recognition device. Such a device has a regular structure involving only local communication between very simple processors. This suggests a VLSI implementation of the device. This issue is also discussed.