2003
DOI: 10.1109/tvlsi.2002.800526
|View full text |Cite
|
Sign up to set email alerts
|

Carry checking/parity prediction adders and ALUs

Abstract: In this paper, we present efficient self-checking implementations valid for all existing adder and arithmetic and logic unit (ALU) schemes (e.g., ripple carry, carry lookahead, skip carry schemes). Among all the known self-checking adder and ALU designs, the parity prediction scheme has the advantage that it requires the minimum hardware overhead for the adder/ALU and the minimum hardware overhead for the other data-path blocks. It also has the advantage to be compatible with memory systems checked by parity c… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
48
0

Year Published

2006
2006
2014
2014

Publication Types

Select...
4
4
2

Relationship

0
10

Authors

Journals

citations
Cited by 105 publications
(52 citation statements)
references
References 10 publications
0
48
0
Order By: Relevance
“…Nicolaidis employed parity prediction and double rail checking together to devise a self-checking mechanism for ALUs and adders. Furthermore, different hardware reduction techniques were used to minimize the cost [27].…”
Section: Related Workmentioning
confidence: 99%
“…Nicolaidis employed parity prediction and double rail checking together to devise a self-checking mechanism for ALUs and adders. Furthermore, different hardware reduction techniques were used to minimize the cost [27].…”
Section: Related Workmentioning
confidence: 99%
“…The fault coverage of the presented adder can be tested as described in [23]. Briefly, it can be stated that the faults on the carry signals are detected using the double rail checkers because all errors are propagated through the checker tree.…”
Section: Self Checking Addermentioning
confidence: 99%
“…We give thereby preliminary research directions towards selfcalibrating adder circuits independent of worst-case assumptions about the adder itself. The discussion expands on prior work about parity prediction for adders and ALUs [9].…”
Section: Extension To Computationmentioning
confidence: 83%