Case Study: Pattern Matching
Fayez Gebali · 2011
This chapter contains sections titled: Introduction Expressing the Algorithm as a Regular Iterative Algorithm (RIA) Obtaining the Algorithm Dependence Graph Data Scheduling DAG Node Projection DESIGN 1: Design Space Exploration When s = [1 1]t DESIGN 2: Design Space Exploration When s = [1 -1]t DESIGN 3: Design Space Exploration When s = [1 0]t