Fault Simulation of IDDQ Tests for Bridging Faults in Sequential Circuits

Authors:
P. Thadikaran;S. Chakravarty;J. Patel
Affiliations:
-;-;-
Venue:
FTCS '95 Proceedings of the Twenty-Fifth International Symposium on Fault-Tolerant Computing
Year:
1995

Citing 5
Cited 3

Realistic fault modeling for VLSI testing

DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
Gentest: An Automatic Test-Generation System for Sequential Circuits

Computer
Algorithms for IDDQ measurement based diagnosis of bridging faults

Journal of Electronic Testing: Theory and Applications - Special issue on IDDQ testing of VLSI circuits
A Study of IDDQ Subset Selection Algorithms for Bridging Faults

Proceedings of the IEEE International Test Conference on TEST: The Next 25 Years
HITEC: a test generation package for sequential circuits

EURO-DAC '91 Proceedings of the conference on European design automation

Simulation and Generation of IDDQ Tests for Bridging Faults in Combinational Circuits

IEEE Transactions on Computers
Bridging Faults in Pipelined Circuits

Journal of Electronic Testing: Theory and Applications
Fast Algorithms for Computer IDDQ Tests for Combination Circuits

VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

Abstract: The notion of indistinguishable pairs is introduced. Two methods to compute such pairs-an explicit scheme and an implicit scheme-are presented. The resulting fault simulation algorithms, list-based scheme and tree-based scheme are compared using a variety of faultlists and test sets. The performance of the tree-based scheme is found to be superior to the list-based scheme. Applications where the list-based scheme perform better are discussed.