New parallel implementations for DTW algorithms

The parallel realization of a popular dynamic time warping (DTW) algorithm is discussed. Two alternative techniques are proposed, one based on a circular array and the other using a linear array of processing elements (PEs). The architecture of each PE is defined in both cases and computational phases are outlined. The number of PEs is not restricted to be fixed. With small modifications, both of the techniques can implement DTW with any number of PEs available. The performance of the new architectures is superior to that of architectures previously reported in the literature.<
>