Area efficient methods to increase the reliability of combinatorial circuits (Q5096165): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Area-Time Complexity of Binary Multiplication / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reliable computation with cellular automata / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A simple three-dimensional real-time reliable cellular array / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3770453 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Universality considerations in VLSI circuits / rank | |||
Normal rank |
Latest revision as of 22:15, 29 July 2024
scientific article; zbMATH DE number 7571938
Language | Label | Description | Also known as |
---|---|---|---|
English | Area efficient methods to increase the reliability of combinatorial circuits |
scientific article; zbMATH DE number 7571938 |
Statements
Area efficient methods to increase the reliability of combinatorial circuits (English)
0 references
16 August 2022
0 references
Boolean function
0 references
error probability
0 references
failure probability
0 references
switching element
0 references
combinational circuit
0 references