Quick detection of faults in combinational networks designed in minterm format by computing a single novel parameter

DOI10.1080/00207160701652953zbMath1161.94458OpenAlexW1973651293MaRDI QIDQ3615544

Pramode Ranjan Bhattacharjee

Publication date: 20 March 2009

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701652953

zbMATH Keywords

Walsh functionWalsh coefficientcombinational networkminterms-a-0 and s-a-1 faults

Mathematics Subject Classification ID

Applications of design theory to circuits and networks (94C30) Boolean functions (06E30) Logical aspects of Boolean algebras (03G05)

Cites Work

• Complete test-set generation for bridging faults in combinational-logic circuits
• Syndrome-Testable Design of Combinational Circuits
• Transition Count Testing of Combinational Logic Circuits
• Diagnosis of Automata Failures: A Calculus and a Method
• Analyzing Errors with the Boolean Difference

This page was built for publication: Quick detection of faults in combinational networks designed in minterm format by computing a single novel parameter