Development of high speed booth multiplier with optimized stuck-at fault implementation
Multiplier is a basic device in many digital systems such as signal processor, calculator and micro controller. Thus a fast multiplier is very important in improving the speed of the digital system. In general, there are two basic approaches to enhance the speed of the multiplier, Booth Algorithm...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
Universiti Putra Malaysia Press
2002
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/18396/1/18396.pdf http://psasir.upm.edu.my/id/eprint/18396/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Multiplier is a basic device in many digital systems such as signal processor, calculator and micro controller.
Thus a fast multiplier is very important in improving the speed of the digital system. In general, there are two basic
approaches to enhance the speed of the multiplier, Booth Algorithm and the Wallace Tree compressors or counter. Booth
Multiplier is proposed due to make sure that multiplication of positive and negative values can be done in 2's complement system operation. For that reason, Booth Multiplier is very demanding to many microprocessor or micro controller chip manufacturers. A part from that, time to market elcaupare very consuming to them, thus failure design can increase production operation and also total costing. So applied DFT is needed due to reduce the production time and total costing. Deterministic technique will be used to detect failure circuit base on test pattern generation. The Test Pattern Generation(TPG) is the process of providing a set of test stimuli plus expected fault free response to meet the requirement of a target fault list. Test for logic circuits are generated to set a sensitive path for a specific fault-effect such Stuck-at-Fault model. |
|---|