Scalable processor core for high-speed pattern matching architecture on FPGA

In recent pattern matching architecture researches, there has been much attention to high-throughput implementations with reconfiguration on the fly on FPGAs as well as ASICs. In this paper, we propose to use self-organizing approach to synthesize two-dimensional map (cluster) of a simple processing units with lateral links for fast pattern matching of one-dimensional input event. We suggest scalable processor core with heterogeneous cluster architecture. Experimental results show that the proposed architecture has advantages over the previously developed architectures in the terms of operating frequency, time delay and data bandwidth. For state-of-the-art FPGA we achieve operating frequency 600-500 MHz for the processor core with single cluster (input pattern of 8-512 bits, rule set of 64 bits), 490-440 MHz for the processor core with multiple clusters (rule set of 128 - 4096 bits, input pattern of 512 bits). Each cluster is characterized by low pipeline time delay of 3 ~ 5 clock cycles.