- Tytuł:
- New self-checking booth multipliers
- Autorzy:
-
Hunger, M.
Marienfeld, D. - Powiązania:
- https://bibliotekanauki.pl/articles/907920.pdf
- Data publikacji:
- 2008
- Wydawca:
- Uniwersytet Zielonogórski. Oficyna Wydawnicza
- Tematy:
-
mnożnik Booth'a
samokontrola działania
przewidywanie parzystości
Booth multiplier
self-checking
parity-prediction
carry-dependent adder
1-out-of-5 code - Opis:
- This work presents the first self-checking Booth-3 multiplier and a new self-checking Booth-2 multiplier using parity prediction. We propose a method which combines error-detection of Booth-3 (or Booth-2) decoder cells and parity prediction. Additionally, code disjointness is ensured by reusing logic for partial product generation. Parity prediction is applied to a carry-save-adder with the standard sign-bit extension. In this adder almost all cells have odd fanouts and faults are detected by the parity. Only one adder cell has an even fanout in the case of Booth-3 multiplication. Especially, for even-number Booth-2 multipliers parity prediction becomes efficient. Since that prediction slightly differs from previous work which describes CSA-folded adders, formulas to predict the parity are developed here. The proposed multipliers are compared experimentally with existing solutions. Only 102% of the area of Booth-2 without error detection is needed for the self-checking Booth-3 multiplier.
- Źródło:
-
International Journal of Applied Mathematics and Computer Science; 2008, 18, 3; 319-328
1641-876X
2083-8492 - Pojawia się w:
- International Journal of Applied Mathematics and Computer Science
- Dostawca treści:
- Biblioteka Nauki
Artykuł