Presentation
Scored Non-Deterministic Finite Automata Processor for Sequence Alignment
DescriptionWith the surge in symbolic data across various fields, efficient pattern matching and regular expression processing have become crucial. Non-deterministic Finite Automata (NFA), commonly used for pattern matching, face memory bottlenecks on general-purpose platforms. This has driven interest in Domain-Specific Architectures (DSAs), like FPGA and ASICs, for their efficiency. Modern applications require identifying the best match path, such as in DNA sequence alignment. This work aims to enhance FPGA-based automata processors to report the best sequence alignment score by integrating weights into automata transitions. Challenges include increased state-space complexity and memory requirements. The proposed NAPOLY+ design incorporates score values and arithmetic components to manage scores, balancing performance and resource use. Evaluation on the Zynq Ultrascale+ FPGA showed high device utilization and scalability, with preliminary results focusing on end-to-end design evaluation.
Event Type
ACM Student Research Competition: Graduate Poster
ACM Student Research Competition: Undergraduate Poster
Doctoral Showcase
Posters
TimeTuesday, 19 November 202412pm - 5pm EST
LocationB302-B305
TP
XO/EX