Using FPGAs to accelerate Myers bit-vector algorithm

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a proof-of-concept implementation of Myers bit-vector algorithm for approximate string matching in hardware. In terms of bit-vector operations, the algorithm is accelerated by using the massive parallel computing capabilities of a field programmable gate array (FPGA). The system is realized on an embedded platform with a high computational and energy efficiency. Compared to the fastest software implementation running on the embedded processor, the hardware achieves an overall speed-up of approximately 2 and a speed-up of approximately 8 considering the computation only.

Cite

CITATION STYLE

APA

Hoffmann, J., Zeckzer, D., & Bogdan, M. (2016). Using FPGAs to accelerate Myers bit-vector algorithm. In IFMBE Proceedings (Vol. 57, pp. 529–535). Springer Verlag. https://doi.org/10.1007/978-3-319-32703-7_104

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free