By Topic

A method for identifying robust dependent and functionally unsensitizable paths

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
S. Kajihara ; Dept. of Comput. Sci. & Electron., Kyushu Inst. of Technol., Japan ; K. Kinoshita ; I. Pomeranz ; S. M. Reddy

It has been shown previously that a logic circuit often contains a large number of logical paths that need not be tested to verify the timing behavior of the circuit, if the other paths are robustly tested. These paths are called robust dependent. A subset of the robust dependent paths are the functionally unsensitizable paths. This paper proposes a method for efficiently identifying both types of paths. The proposed procedure uses local circuit analysis to keep the run time relatively low, and relatively independent of the number of paths in the circuit. The method may not identify all the paths that are robust dependent or functionally unsensitizable, however, experimental results show that the numbers it finds are comparable, and sometimes even higher than those found by other methods. The procedure can be applied to circuits that cannot be handled by other methods

Published in:

VLSI Design, 1997. Proceedings., Tenth International Conference on

Date of Conference:

4-7 Jan 1997