IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · 1992 · 30 citations · 14 references
EngineeringComputer EngineeringComputer ScienceComputer ArchitectureFault-tolerant ComputingFault-tolerant SystemsDesign For TestabilityLogic SynthesisReliable System DesignDelay Fault TestingFault-tolerant Logic DesignFault-tolerant NetworksMultilevel Network ModelsPerformance RequirementsTestabilityTestability EngineeringTestability-driven Synthesis
The authors advocate a synthesis approach to delay-fault testing, wherein completely path-delay-fault testable circuits are automatically synthesized, meeting area and performance requirements. They give necessary and sufficient conditions for validatable nonrobust fault testability of paths in arbitrary multilevel networks. Validatable nonrobust testing as opposed to robust testing offers degrees of freedom that enable the development of efficient synthesis procedures that target delay-fault testability, and also provides a means of producing compact test vector sets. The authors then focus on the development of synthesis procedures that produce networks that are fully testable under the nonrobust fault model. They show that primality and irredundancy are both a necessary and sufficient condition for complete validatable nonrobust testability in the two-level case. They prove that synthesizing a multilevel network using algebraic factorization retains complete validatable nonrobust testability. Preliminary results that verify the procedures are reported.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
14