Faster implementation of Booth's algorithm using FPGA

Abstract

Modern world has become more dependent on electronics and hence speed is a major factor in the field of their functionalities. Modern CPUs work lot faster and efficiently than older versions. Still humans require more and more time efficiency in their daily computational works. In this paper, the main focus is on the increase of time efficiency in computing. Hence this paper shows a time performance comparison between FPGA and CPU implementation. In this regard, Booth's multiplication algorithm has been implemented on both CPU and FPGA to compare the running time. The FPGA implementation is found out to be around 9 times faster than that of a modern CPU implementation.