Improved systolic algorithms for substrings statistics
M. Jean-Frederic, Waqar Ahmad · 2002
Improved linear and square systolic arrays are presented that support the detection of repetitions in a string and the substring statistics with and without overlap. The time equals 5n/4-1 and n for the first and the second problems respectively, where n is the length of the string, and the number of processors is, respectively, n/4 and n/sup 2//2.