About this Journal Submit a Manuscript Table of Contents
VLSI Design
Volume 5 (1997), Issue 3, Pages 241-252
http://dx.doi.org/10.1155/1997/93809

IDDQ Detectable Bridges in Combinational CMOS Circuits

Departament d'Enginyeria Electrònica, Universitat Politècnica de Catalunya, Diagonal 647, Barcelona. 08028, Spain

Copyright © 1997 Hindawi Publishing Corporation. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Undetectable stuck-at faults in combinational circuits are related to the existence of logic redundancy (s-redundancy). Similarly, logically equivalent nodes may cause some bridging faults to become undetectable by IDDQ testing. An efficient method for the identification and removal of such functionally equivalent nodes (f-redundant nodes) in combinational circuits is presented. OBDD graphs are used to identify the functional equivalence of candidate to f-redundancy nodes. An f-redundancy removal algorithm based on circuit transformations to improve bridging fault testability, is also proposed. The efficiency of the identification and removal of f-redundancy has been evaluated on a set of benchmark circuits.