The `addBinary` method in Booth's Algorithm performs binary addition of two binary strings. It sequentially adds the bits from right to left, considering any carry from the previous addition step. The method is crucial for implementing addition of the multiplicand or its negative in two's complement form to the current product. Its accurate execution ensures the proper arithmetic operations on binary numbers, supporting the broader multiplication process that Booth's Algorithm handles .

Performing an arithmetic right shift in Booth's Algorithm is necessary to ensure that the partial products are correctly aligned during each cycle of evaluation, preserving the sign bit and reflecting changes across the A, Q, and Q1 registers. Without this step, the algorithm would have difficulty maintaining proper position alignment and sign integrity of the intermediary results, potentially resulting in incorrect multiplication outcomes, especially with negative numbers .

The two's complement representation plays a critical role in Booth's Algorithm as it allows the algorithm to seamlessly integrate subtraction within the multiplication process by converting subtraction operations into addition. This not only aligns the algorithm with standard binary operations but also reduces the complexity of handling negative numbers, thereby improving performance. Two's complement ensures that both positive and negative numbers are uniformly processed without additional logic to differentiate operations based on the sign .

The computational complexity of Booth's Algorithm is generally more efficient than traditional long multiplication, as it reduces the number of additions needed by consolidating both positive and negative operations via arithmetic shifts and two's complement additions. While long multiplication requires a straight iterative approach with potential operations in each cycle based on the number of bits, Booth's Algorithm minimizes redundant operations through efficient encoding and shifting logic, such as leveraging two's complement for handling sign changes efficiently .

To convert a binary number to decimal in Booth's Algorithm, start by checking if the number is negative, indicated by a leading '1'. If negative, invert all bits and add one to it to obtain its absolute value in binary form. Then, convert the binary number to a decimal by summing up the values, multiplying each bit by its corresponding power of two position. If it was negative, multiply the result by -1 to get the final decimal value .

Booth's Algorithm implements binary multiplication by encoding the process to handle both positive and negative multipliers efficiently, utilizing arithmetic right shifts and adding either the multiplicand or its two's complement according to the bits of the multiplier and an auxiliary bit Q1. This offers advantages over standard methods by reducing the number of necessary arithmetic operations, particularly for negative numbers, through its encoding mechanism that converts subtraction to addition and vice versa using two's complement representation .

Booth's Algorithm is implemented in Java to handle negative multiplicands and multipliers by using two's complement representation. The algorithm utilizes methods such as `toBinary` to convert numbers into binary strings, and `twoComplement` to find their two's complements. Then, it conditions the addition of the multiplicand or its two's complement to the intermediary result based on the current and the previous bit of the multiplier, encoded as Q1 and the last bit of Q, respectively. This allows for seamless calculations irrespective of the sign .

Implementing and running Booth's Algorithm in Java involves writing the main components of the algorithm: the conversion functions like `toBinary`, `binaryToDecimal`, `addBinary`, and `twoComplement`. The algorithm logic itself, `boothsAlgorithm`, coordinates these methods to execute the multiplication process with steps that include binary conversion, conditionally modifying the accumulator, and performing arithmetic right shifts. Example usage requires input for the multiplicand and multiplier, which the implementation processes to output the binary and decimal result of the multiplication .

Booth's Algorithm handles signed integer multiplication more effectively than the basic shift-and-add algorithm by integrating the two's complement system to manage sign and perform subtraction as an addition operation. The key advantage lies in its ability to encode sign changes within its standard operational cycle using arithmetic right shifts and conditional assertions based on segment of the multiplier. This results in fewer instructions compared to the shift-and-add which separately deals with sign bits and may require additional operations to address negative numbers .

In Booth's Algorithm, the 'arithmetic right shift' is significant because it preserves the sign of the binary number being shifted, which is especially important when dealing with signed numbers in two's complement form. This ensures the correct handling of negative numbers during the multiplication process. Unlike a logical shift, which fills the vacated bit with a zero, an arithmetic right shift replicates the sign bit (the most significant bit) to maintain the number's sign .