Booth's algorithm examines adjacent pairs of bits of the 'N'-bit multiplier "Y" in signed two's complement representation, including an implicit bit below the least significant bit, "y"−1 = 0. For each bit "y""i", for "i" running from 0 to "N" − 1, the bits "y""i" and "y""i"−1 are considered. Where these two bits are equal, the product accumulator "P" is left unchanged. Where "y""i" = 0 and "y""i"−1 = 1, the multiplicand times 2"i" is added to "P"; and where "y"i = 1 and "y"i−1 = 0, the multiplicand times 2"i" is subtracted from "P". The final value of "P" is the signed product.