By Topic

Improved systolic algorithms for substrings statistics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jean-Frederic, M. ; LaRIA, CUR, Univ. de Picardie Jules Verne, Amiens, France ; Ahmad, W.

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 n2/2

Published in:

Algorithms & Architectures for Parallel Processing, 1996. ICAPP 96. 1996 IEEE Second International Conference on

Date of Conference:

11-13 Jun 1996