An Efficient IDDQ Test Generation Scheme for Bridging Faults in CMOS Digital Circuits

  • Authors:
  • Tzuhao Chen;Ibrahim N. Hajj;Elizabeth M. Rudnick;Janak H. Patel

  • Affiliations:
  • -;-;-;-

  • Venue:
  • IDDQ '96 Proceedings of the 1996 IEEE International Workshop on IDDQ Testing (IDDQ '96)
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

In a previous work on test generation for IDDQ bridging faults in CMOS circuits, a genetic algorithm (GA) based approach targeting the all-pair bridging fault set stored in a compact-list data structure was used. In this paper, we target a reduced fault set, such as the one extracted from circuit layout. The reduced fault set is O(N) versus O(N^2) for the all-pair set, where N is the number of nodes in the transistor netlist. For test generation purposes, a linear-list data structure is found to be more efficient than the compact-list when a reduced fault list is targeted. We report on results for benchmark circuits that illustrate that test generation using a reduced fault list takes less time and results in more compact IDDQ test sets with higher fault coverage of targeted bridging faults. The effects of GA sequence lengths on test generation times and test set quality are also considered.