Area efficient methods to increase the reliability of combinatorial circuits

DOI10.1007/BFb0028995zbMath1492.68049MaRDI QIDQ5096165

Bernd Schmeltz, K. Ruediger Reischuk

Publication date: 16 August 2022

Published in: STACS 89 (Search for Journal in Brave)

zbMATH Keywords

Boolean function; failure probability; error probability; combinational circuit; switching element

Mathematics Subject Classification ID

94C12: Fault detection; testing in circuits and networks

68M15: Reliability, testing and fault tolerance of networks and computer systems

94C11: Switching theory, applications of Boolean algebras to circuits and networks

68Q06: Networks and circuits as models of computation; circuit complexity

Related Items

Can large fanin circuits perform reliable computations in the presence of faults?