<span style="font-family: ";Times New Roman";,";serif";; font-size: 9pt; mso-fareast-font-family: 'Times New Roman'; mso-ansi-language: EN-US; mso-fareast-language: PT-BR; mso-bidi-language: AR-SA;" lang="EN-US">In this paper, we introduce new dedicated blocks for radix-2^m multiplication. These blocks are basic components of the structure of the 2´s complement radix-2^m array multiplier previously proposed in the literature. In the original array multiplier, the blocks that perform the radix-2^mmultiplication were automatically synthesized from a truth table. The dedicated 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 different radices 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 more efficient in terms of delay and power consumption when compared both against the original array structure and the Modified Booth multiplier.</span>

No abstract

No abstract

No abstract