|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 2 van 20 gevonden artikelen
| Titel: |
A fast multiplier based on the modified Booth algorithm |
| Auteur: |
Sunder, S. |
| Verschenen in: |
International journal of electronics |
| Paginering: | Jaargang 75 (1993) nr. 2 pagina's 199-208 |
| Jaar: |
1993-08-01 |
| Inhoud: |
In the conventional modified Booth algorithm (MBA), three-bit segments of the multiplier are scanned and appropriate operations effected on the multiplicand. This scheme generates N/2 rows of partial products where N is the size of the multiplier. An extension of the MBA involves scanning of four-bit segments in which appropriate operations are effected on the multiplicand to generate N/3 rows of partial products. In using this version of the MBA algorithm there is a non-trivial operation, namely, a multiplication of the multiplicand by three. We show that this operation can be accomplished by pre-computing three times the multiplicand by using a carry look-ahead adder that adds the multiplicand with the left-shifted version of the multiplicand. This has resulted in a multiplier that has a lower area x time complexity than the multiplier using the MBA in which three-bit segments are scanned. |
| Uitgever: |
Taylor & Francis |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 2 van 20 gevonden artikelen
| << vorige | volgende >> |