A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Can large fanin circuits perform reliable computations in the presence of faults?
2000
Theoretical Computer Science
For ordinary circuits with a ÿxed upper bound on the fanin of its gates it has been shown that logarithmic redundancy is necessary and su cient to overcome random hardware faults (noise). Here, we consider the same question for unbounded fanin circuits which in the fault-free case can compute Boolean functions in sublogarithmic depth. Now the details of the fault model become more important. One may assume that only gates, resp. only wires may deliver wrong values, or that both gates and wires
doi:10.1016/s0304-3975(99)00237-6
fatcat:5muctxnjuzbtnniczg26bmnhiq