Project Report on “16-Bit Booth’s Multiplier”
FINAL SEMESTER ASSESSMENT (FSA) – B.TECH. (CSE)
III SEM SESSION: AUGUST – DECEMBER, 2018
UE17CS206 – DIGITAL DESIGN & COMPUTER ORGANIZATION LABORATORY
Booth's multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in two's complement notation.
Booth's algorithm can be implemented by repeatedly adding (with ordinary unsigned binary addition) one of two predetermined values A and S to a product P, then performing a rightward arithmetic shift on P. Let m and r be the multiplicand and multiplier, respectively; and let x and y represent the number of bits in m and r.
Verilog+GtkWave