This is an implementation of Booth' Algorithm for multiplying signed and unsigned binary numbers.
Motivation:
It is difficult to see and understand that why the Booth's Algorithm does works and produces correct answer. By this project I hope to understand the algorithm in depth and also help someone new to understand the same by showing the status of different registers during each cycle.
Prerequisites:
java installed (preferably with an IDE)
Features:
- --Great way to understand the Booth's Algorithm.
- --Option to see all the steps of the computation in the algorithm.
- --Can multiply both signed and unsigned integers.
How to use?
Easy ! Run the 'boothAlgorithm.java' in a suitable JAVA IDE. Do not alter the file locations of different files in the folder 'Booth's Algorithm'. Read Documentation for more details.
License:
Manas Gupta
Contact: