The quasi-Booth multiplier

Abstract

A new approach to number representation is presented to implement fast parallel multipliers: the operands are given in a signed-digit representation, similar to the one proposed by Booth. With respect to a multiplier based on the Booth's notation, our approach allows one to save circuit complexity and, as a consequence, silicon area (up to 20% for the partial product generator).