Live briefing
Everything about Booth's multiplication algorithm
Algorithm that multiplies two signed binary numbers in two's complement notation
Booth's multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in two's complement notation. The algorithm was invented by Andrew Donald Booth in 1950 while doing research on crystallography at Birkbeck College in Bloomsbury, London. Booth's algorithm is of interest in the study of computer architecture. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Booth's multiplication algorithmA 5-minute orientation
- Skim a recent paper: Variable Precision Multiplier for CNN Accelerators Based on Booth AlgorithmInfluential work since 2022
- Read the landmark paper: A fast parallel multiplier-accumulator using the modified Booth algorithmCited 72 times
- Go sideways: Binary multiplierA closely related topic
- Go sideways: Two's complementA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A fast parallel multiplier-accumulator using the modified Booth algorithm
Modified Booth algorithm for high radix fixed-point multiplication
VLSI Architectures of Booth Multiplication Algorithms – A Review
A fast multiplier based on the modified Booth algorithm
A modified Booth algorithm for high radix fixed-point multiplication
Radix-16 Booth multiplier using novel weighted 2-stage Booth algorithm
High Accuracy Fixed Width Multipliers using Modified Booth Algorithm
Implementation of Booth Multiplier Algorithm using Radix-4 in FPGA
🆕 Influential since 2022
Variable Precision Multiplier for CNN Accelerators Based on Booth Algorithm
16-Bit multiplier optimization based on Wallace tree and Booth algorithm
Enhancing multiplication efficiency: Harnessing Booth algorithm and Wallace tree synergy for 32-bit signed multipliers
Multiplier Design Based on Booth and Sequential Algorithm
An FPGA Implementation of Modulo Multiplier Using Radix-8 Booth Algorithm
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- Binary multiplier A binary multiplier is an electronic circuit used in digital electronics, such as a computer, to multiply two binary numbers. A variety of computer arithmetic…
- Two's complement Two's complement is the most common method of representing signed (positive, negative, and zero) integers on computers, and more generally, fixed point…
- Multiplication Multiplication is one of the four elementary mathematical operations of arithmetic, with the other ones being addition, subtraction, and division. The…
- Multiplication algorithm A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient…
- Kochanski multiplication Kochanski multiplication is an algorithm that allows modular arithmetic (multiplication or operations based on it, such as exponentiation) to be performed…
- Scale factor (computer science) In computer science, a scale factor is a number used as a multiplier to represent a number on a different scale, functioning similarly to an exponent in…
- Finite field arithmetic In mathematics, finite field arithmetic is arithmetic in a finite field (a field containing a finite number of elements) contrary to arithmetic in a field…
- Bitwise operations in C In the C programming language, operations can be performed on a bit level using bitwise operators. Bitwise operations are contrasted by byte-level operations…