An error-detectable array for all-substring comparison

All-substring comparison for pattern P and string S gives the minimum distance between P and all the consecutive substrings in S, which is more general than usual string comparison problems. Run-time error detection is a desirable property in practice. The author designs an error-detectable systolic array for the problem of all-substring comparison, and analyzes the performance of the design. He incorporates a novel design methodology, called ITRED, in the 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.<
>