Area efficient methods to increase the reliability of combinatorial circuits

DOI10.1007/BFB0028995MaRDI QIDQ5096165zbMATH OpenFDO

Authors Bernd Schmeltz, Rüdiger Reischuk

Publication date 16 August 2022

Published in STACS 89 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0028995

zbMATH Keywords

Boolean functioncombinational circuiterror probabilityfailure probabilityswitching element

Mathematics Subject Classification ID

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

Cites work

• A simple three-dimensional real-time reliable cellular array
• scientific article; zbMATH DE number 4029459 (Why is no real title available?)
• Reliable computation with cellular automata
• The Area-Time Complexity of Binary Multiplication
• Universality considerations in VLSI circuits

Cited in

(1)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096165)