Efficient Cell Designs for Systolic Smith-Waterman Implementations

Abstract

Smith-Waterman algorithm is used to search bioinformatics databases. The systolic array implementations of this algorithm can search databases hundreds of times faster than software applications. The performances of the systolic Smith-Waterman implementations mainly depend on the number of cells they contain and the clock frequencies of the cells. This paper presents efficient cell designs for systolic Smith-Waterman implementations. The designs that use the presented cells and the recent reference designs are mapped on the same FPGA platform and compared by syntheses. Syntheses results show that the performance of the presented designs are 1.7 to 3.6 times higher than the reference designs.