String processing on the hypercube

Author

Ibarra, Oscar H. ; Pong, Ting-Chuen ; Sohn, Stephen M.

Author_Institution

Dept. of Comput. Sci., Minnesota Univ., Minneapolis, MN, USA

Volume

38

Issue

1

fYear

1990

fDate

1/1/1990 12:00:00 AM

Firstpage

160

Lastpage

164

Abstract

Parallel algorithms are given for solving some string-comparison problems on the hypercube. These algorithms are widely applicable to the problems of speech and signal processing. For strings x and y with length (x)=m, length (y)=n, and assuming n⩾m, the authors show that the substring problem can be solved in O(m+log(n/m)) time using O( m) space per processing element (PE) on an MIMD hypercube of O(n/m) PEs. They note that this algorithm has an optimal processor-time product if m is bounded below by log( n/m). The results of implementing this algorithm on the NCUBE/7 hypercube machine are presented. The authors also show that the longest common substring problem can be solved in O(log n) time using O(1) space per PE on an SIMD hypercube of O(n²) PEs. It is shown that the string edit problem, the longest common subsequence problem, the minimum-length time-warping problem, and many other speech recognition problems can be solved in O(log²n) time using O(1) space per PE on an SIMD hypercube of O(n³/log²n) PEs

Keywords

computerised signal processing; parallel algorithms; speech analysis and processing; MIMD hypercube; NCUBE/7 hypercube machine; SIMD hypercube; longest common substring problem; minimum-length time-warping problem; multiple input multiple data; optimal processor-time product; parallel algorithms; single instruction multiple data; space per processing element; speech processing; speech recognition problems; string edit problem; string processing; Artificial intelligence; Costs; Hypercubes; Parallel algorithms; Pattern recognition; Signal processing; Signal processing algorithms; Speech processing; Speech recognition; Text processing;

fLanguage

English

Journal_Title

Acoustics, Speech and Signal Processing, IEEE Transactions on

Publisher

ieee

ISSN

0096-3518

Type

jour

DOI

10.1109/29.45630

Filename

45630