Title :
A VLSI hardware accelerator for dynamic time warping
Author :
Sundaresan, V.K. ; Nichani, S. ; Ranganathan, N. ; Sankar, R.
Author_Institution :
Center for Microelectron. Res., Univ. of South Florida, Tampa, FL, USA
fDate :
30 Aug-3 Sep 1992
Abstract :
Describes an area and time efficient systolic array architecture for computations in Dynamic Time Warping (DTW). The special purpose architecture is used to perform the band matrix multiplication in order to compute the local distance metric based on Itakura´s log likelihood distance. The time complexity of the algorithm is O(nk) where n and k are the number of elements in the row of the first and second input matrices. The number of processors is equal to the bandwidth w of the output band matrix. The speedup of the parallel algorithm compared to the sequential algorithm is wz where z is the multiplier stages within a PE. The parallel algorithm can be implemented as a single VLSI chip
Keywords :
computational complexity; parallel algorithms; speech recognition; systolic arrays; Dynamic Time Warping; VLSI chip; band matrix multiplication; local distance metric; parallel algorithm; systolic array architecture; time complexity; Bandwidth; Computer architecture; Computer science; Dynamic programming; Hardware; Linear predictive coding; Parallel algorithms; Systolic arrays; Testing; Very large scale integration;
Conference_Titel :
Pattern Recognition, 1992. Vol. IV. Conference D: Architectures for Vision and Pattern Recognition, Proceedings., 11th IAPR International Conference on
Conference_Location :
The Hague
Print_ISBN :
0-8186-2925-8
DOI :
10.1109/ICPR.1992.202121