By Topic

Care bit density and test cube clusters: multi-level compression opportunities

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

1 Author(s)
B. Koenemann ; Cadence Design Syst. Inc., San Jose, CA, USA

Most of the recently discussed and commercially introduced test stimulus data compression techniques are based on low care bit densities found in typical scan test vectors. Data volume and test times are reduced primarily by compressing the don't-care bit information. The original care bit density, hence, dominates the theoretical compression limits. Further compression can be achieved by focusing on opportunities to compress care bit information in addition to the don't-care bit information. We discuss at a conceptual level how data compression based on test cube clustering effects, as used in weighted random pattern methods, could be combined with care bit oriented methods to achieve multilevel test stimulus compression.

Published in:

Computer Design, 2003. Proceedings. 21st International Conference on

Date of Conference:

13-15 Oct. 2003