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 functionfailure probabilityerror probabilitycombinational circuitswitching element

Mathematics Subject Classification ID

Fault detection; testing in circuits and networks (94C12) Reliability, testing and fault tolerance of networks and computer systems (68M15) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (1)

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

Cites Work

• Unnamed Item
• Reliable computation with cellular automata
• A simple three-dimensional real-time reliable cellular array
• Universality considerations in VLSI circuits
• The Area-Time Complexity of Binary Multiplication

This page was built for publication: Area efficient methods to increase the reliability of combinatorial circuits