By Topic

Space compaction for multiple-output circuits

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

2 Author(s)
M. Serra ; Dept. of Comput. Sci., Victoria Univ., BC, Canada ; J. C. Muzio

A counting signature for multiple-output circuits is introduced. It implements both time compaction and space compaction, such that a single signature is derived for all outputs, using a simple scheme with suitable built-in implementation. It is shown that there exists testability criteria that show deterministically at design time, without full-fault simulation, whether a fault is testable by the signature. The computation of such criteria is straightforward, can be easily incorporated into a CAD system such that the testability results are directly available to the designer. The best current application of such a space-compacted signature is to PLAs (programmable logic arrays) and ROMs (read-only memories), where full testability of all single faults is achieved. Discussion, results, proofs, and examples are presented, including an initial comparison with multiple-input shift registers (MISRs)

Published in:

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  (Volume:7 ,  Issue: 10 )