ResearchBib Share Your Research, Maximize Your Social Impacts
Sign for Notice Everyday Sign up >> Login

Fast Speed Base of Two Multiplication

Journal: International Journal of Science and Research (IJSR) (Vol.11, No. 2)

Publication Date:

Authors : ;

Page : 313-315

Keywords : Binary Multiplier Booth Multiplication Algorithm;

Source : Downloadexternal Find it from : Google Scholarexternal


Multiplication is major concern in calculations. Performing multiplication on floating-point data is a long course of action and requires huge quantity of processing tremendous amount of handling time. By improve the fast speed of multiplication task overall speed of the system can be enhanced. The Bottleneck in the floating-point multiplication process is the multiplication of mantissas which need 53?53 bit integer multiplier for double precision floating-point numbers and Medic, and Chronic Signed digit algorithms exists to compare parameters like speed, complexity o f routing, pipe lining, resource required on FPGA. The comparison showed that Chronic Signed Digit Algorithm and Booth Multiplication Algorithm is better than Medic algorithm concerning speed and resources required on spartan3 FPGA

Last modified: 2022-05-14 21:00:31