By Topic

An efficient method to generate test vectors for combinational cell verification

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
$31 $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)

In library cell verification, functionality and timing of each cell needs to be verified. Generation of an optimal and exhaustive test stimuli for each cell is a challenging problem. Though formal verification techniques are available today, vector based verification is still practiced in the industry. Here we introduce an efficient method to generate test vectors for the verification of combinational cells. The method proposed is based on the extended Gray-code concept. Generated test vectors cover all possible Single Input Change (SIC) transitions without any redundancy. An optimal implementation scheme, in terms of performance and memory, is also proposed.

Published in:

VLSI Design, 2004. Proceedings. 17th International Conference on

Date of Conference:

2004