Comparison of Modified Booth Multiplier Techniques
Authors : Meghana M N; Mallikarjuna R Mulimani; Shiva prasad A S; Venkatesh R; Vignesh D
Volume/Issue : Volume 10 - 2025, Issue 5 - May
Google Scholar : https://tinyurl.com/ccm5pvce
DOI : https://doi.org/10.38124/ijisrt/25may1725
Note : A published paper may take 4-5 working days from the publication date to appear in PlumX Metrics, Semantic Scholar, and ResearchGate.
Abstract : Booth's Algorithm is a multiplication algorithm used to perform signed binary multiplication efficiently. It minimizes the number of addition and subtraction operations by encoding runs of consecutive ones in the binary representation of a multiplier. This algorithm uses a technique called radix-4 encoding, which reduces the number of required arithmetic operations compared to standard long multiplication. Booth's Algorithm is widely used in computer arithmetic, especially in hardware multipliers, due to its ability to handle both positive and negative numbers uniformly. This paper provides an overview of the algorithm's working mechanism, its advantages, and its significance in digital computing.
Keywords : Booth'sAlgorithm, SignedBinaryMultiplication,Radix-4Encoding,ComputerArithmetic, Hardware Multipliers, Digital Computing, Arithmetic Operations Optimization, Binary Multiplier, Multiplication Algorithm, Run-Length Encoding.
References :
Keywords : Booth'sAlgorithm, SignedBinaryMultiplication,Radix-4Encoding,ComputerArithmetic, Hardware Multipliers, Digital Computing, Arithmetic Operations Optimization, Binary Multiplier, Multiplication Algorithm, Run-Length Encoding.