Efficient dedicated multiplication blocks for 2’s complement radix-16 and radix-256 array multipliers

In this paper, we introduce new dedicated blocks for radix-16 and radix-256 multiplication. These blocks are basic components of the structure of the 2’s complement radix-2
^m
array multiplier proposed previously in the literature. In the original array multiplier, the blocks that perform the radix-16 multiplication were automatically synthesized from a truth table. The dedicated radix-16 multiplication blocks we propose are themselves composed of a structure of less complex multiplication blocks and resort to efficient Carry Save adders (CSA). This new scheme can be naturally extended for radix-256 multiplication. We present results of area, delay and power consumption for 16, 32 and 64 bit array multipliers using the new dedicated modules. The results show that by using the new dedicated modules, the array multipliers are moer efficient in terms of delay and power consumption when compared both against the original array structure and the Modified Booth multiplier.