Booth's Algorithm Calculator

A sleek, dark-themed web application that implements Booth's multiplication algorithm for signed binary numbers in two's complement notation. Built with HTML, Tailwind CSS, and JavaScript, it offers a responsive, industry-level UI with educational features.

Features

• Input: Accepts two numbers (-128 to 127) for multiplication.
• Output: Displays results in decimal and 16-bit binary formats.
• Step-by-Step Solution: Shows detailed steps (AC, QR, Qn+1 states) on demand.
• Educational Blog: Explains Booth's algorithm and its unique origin in crystallography research (1950).
• Responsive Design: Adapts seamlessly to desktop and mobile screens.
• Dark Theme: Modern, visually appealing UI using Tailwind CSS.

Demo

• Home Page: Learn about Booth's algorithm with a historical overview.
• Calculator Page: Enter numbers, calculate, and explore the process.

Installation

1. Clone the repository:

   git clone https://github.com/your-username/booths-algorithm-calculator.git
   

2. Open index.html in a browser with an internet connection (Tailwind CSS is loaded via CDN).

Usage

• Navigate to the Home page for an introduction.
• Go to the Calculator page:
  • Enter two numbers between -128 and 127.
  • Click "Calculate" to see the result.

  -Click "Show Solution" for a step-by-step breakdown.

  Example

• Input: Multiplicand = -5, Multiplier = -7
• Output: Decimal = 35, Binary = 0000000000100011
• Steps: Detailed table of operations (add, subtract, shift).

Tech Stack

• HTML: Structure and content.
• Tailwind CSS: Styling for a modern, responsive UI.
• JavaScript: Implements Booth's algorithm logic.

Algorithm Overview

• Booth's algorithm, developed by Andrew Donald Booth in 1950, optimizes multiplication of signed binary numbers by reducing arithmetic operations. It examines bit pairs in the multiplier, performing additions or subtractions, followed by arithmetic right shifts. Learn more on Wikipedia.

Contributing

• Feel free to fork this repo, submit issues, or send pull requests to enhance functionality or fix bugs.

License

• This project is unlicensed (public domain). Use it freely!

Credits

Built by Shashank Singh