An error-detectable array for All-substring Comparison

String Comparison is an important primitive in many applications such as information retrieval, DNA pattern matching, etc.. All-substring comparison for pattern P and string S gives the minimum distance between P and all the consecutive substrings in 5, which is more general than usual string comparison problems. Run-time error detection is a desirable property in practice. In this paper, we design an error-detectable systolic array for the problem of all-substring comparison, and analyze the performance of our design. We incorporate a novel design methodology, called JTRED, in our design. By using this methodology at the dependency graph level, tests are triggered in the inputs by users, so this approach gives the users flexibility in trading off throughput for error coverage. Little extra hardware is required in this approach.