Add to ORKGIt is shown that at most, n + 3 tests are required to detect any single stuck-at fault in an AND gate or a single faulty EXCLUSIVE OR (EOR) gate in a Reed-Muller canonical form realization of a switching function
Logical reversibility occurs in low-power applications and is an essential feature of quantum circui...
Recently introduced, three-level logic Sum of Pseudoproducts (SPP) forms allow the representation of...
Switching lattices are two-dimensional arrays of four-terminal switches proposed in a seminal paper ...
Abstract: The following assertions are proved: for each natural k, there exists a basis co...
Abstract: Problem statement: The faults in digital circuit can be classified broadly as single stuck...
Abstract: We consider a problem of synthesis of logic networks implementing Boo lean funct...
Abstract: We consider a problem of synthesis of irredundant logic networks in the basis {&...
Abstract: For each Boolean function, we find the exact value of minimal possible length of...
Abstract: Testability analysis of basic and complex logic gates employing complementary pass transis...
Reversibility is of interest in achieving extremely low power dissipation; it is also an inherent de...
Reversible circuits, which permute the set of input vectors, have potential applications in nanocomp...
Abstract: It is established that one can implement almost any Boolean function on n variab...
An efficient method is proposed for detecting hard- to-detect stuck-at faults of combinational circu...
Abstract: We consider a problem of synthesis of irredundant logic circuits in the basis {&...
Switching lattices are two-dimensional arrays of four-terminal switches proposed in a seminal paper ...
Logical reversibility occurs in low-power applications and is an essential feature of quantum circui...
Recently introduced, three-level logic Sum of Pseudoproducts (SPP) forms allow the representation of...
Switching lattices are two-dimensional arrays of four-terminal switches proposed in a seminal paper ...
Abstract: The following assertions are proved: for each natural k, there exists a basis co...
Abstract: Problem statement: The faults in digital circuit can be classified broadly as single stuck...
Abstract: We consider a problem of synthesis of logic networks implementing Boo lean funct...
Abstract: We consider a problem of synthesis of irredundant logic networks in the basis {&...
Abstract: For each Boolean function, we find the exact value of minimal possible length of...
Abstract: Testability analysis of basic and complex logic gates employing complementary pass transis...
Reversibility is of interest in achieving extremely low power dissipation; it is also an inherent de...
Reversible circuits, which permute the set of input vectors, have potential applications in nanocomp...
Abstract: It is established that one can implement almost any Boolean function on n variab...
An efficient method is proposed for detecting hard- to-detect stuck-at faults of combinational circu...
Abstract: We consider a problem of synthesis of irredundant logic circuits in the basis {&...
Switching lattices are two-dimensional arrays of four-terminal switches proposed in a seminal paper ...
Logical reversibility occurs in low-power applications and is an essential feature of quantum circui...
Recently introduced, three-level logic Sum of Pseudoproducts (SPP) forms allow the representation of...
Switching lattices are two-dimensional arrays of four-terminal switches proposed in a seminal paper ...