A New High Radix-2r r ≥ 8 Multibit Recoding Algorithm for Large Operand Size N ≥ 32 Multipliers.Report as inadecuate




A New High Radix-2r r ≥ 8 Multibit Recoding Algorithm for Large Operand Size N ≥ 32 Multipliers. - Download this document for free, or read online. Document in PDF available to download.

1 CTDA - Centre de Développement des Technologies Avancées 2 FEMTO-ST - Franche-Comté Électronique Mécanique, Thermique et Optique - Sciences et Technologies

Abstract : This paper addresses the problem of multiplication with large operand sizes N≥32. We propose a new recursive recoding algorithm that shortens the critical path of the multiplier and reduces the hardware complexity of partial-product-generators as well. The new recoding algorithm provides an optimal space-time partitioning of the multiplier architecture for any size N of the operands. As a result, the critical path is drastically reduced to 33 N - 2 - 3 with no area overhead in comparison to modified Booth algorithm that shows a critical path of N-2 in adder stages. For instance, only 7 adder stages are needed for a 64-bit two-s complement multiplier. Confronted to reference algorithms for N=64, important gain ratios of 1.62, 1.71, 2.64 are obtained in terms of multiply-time, energy consumption per multiply- operation, and total gate count, respectively.





Author: Abdelkrim K. Oudjida - Nicolas Chaillet - Mohamed L. Berrandjia - Ahmed Liacha -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents