Abstract
This paper proposes a methodology for the development of simple arithmetic self-checking circuits using a signed digit representation. In particular, the architecture of an adder is reported and its self-checking capability with respect to the stuck-at fault set is shown. The main idea underlying the paper is to exploit the properties of signed digit representation, allowing carry-free operations. In a carry free adder, the parity can be easily checked, allowing therefore detecting the occurrence of a fault belonging to the considered stuck-at fault set. The proposed architecture is therefore very suitable for the implementation of self-checking adders that are also fast due to the same carry free property.
| Original language | English |
|---|---|
| Title of host publication | Proceedings 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems |
| Place of Publication | Piscataway, NJ |
| Publisher | IEEE |
| Number of pages | 8 |
| ISBN (Print) | 0-7695-2042-1 |
| DOIs | |
| Publication status | Published - 2003 |
| Externally published | Yes |
| Event | 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, DFT 2003 - Boston, United States Duration: 3 Nov 2003 → 5 Nov 2003 |
Conference
| Conference | 18th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems, DFT 2003 |
|---|---|
| Abbreviated title | DFT 2003 |
| Country/Territory | United States |
| City | Boston |
| Period | 3/11/03 → 5/11/03 |
Fingerprint
Dive into the research topics of 'Error detection in signed digit arithmetic circuit with parity checker'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver