Modified Booth Recoder for Efficient Add-Multiply Operator

Abstract: Modified Booth algorithm has made multiplication easier. It consists of recoding table which has been used to minimize the partial products of multiplier. An adder and the multiplier operator of the unit is combine to form a single add-multiply unit. The fusion of the two operators resulting in Fused Add-Multiply(FAM) operator. In this paper different structured recoding techniques are used to implement the Modified Booth encoder incorporating in FAM. Along with the implementation of recoding techniques, comparison has been done with the existing and the designed Modified Booth recoder.

Keywords: Modified Booth Algorithm, adders, multipliers, add-multiply operation, arithmetic circuits, Xilinx.