By Topic

Easily testable nonrestoring and restoring gate-level cellular array dividers

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

2 Author(s)
Jha, N.K. ; Dept. of Eng., Princeton Univ., NJ, USA ; Ahuja, A.

The problem of design for testability of gate-level dividers is investigated using the single stuck-at fault model. Two C-testable designs are given for the nonrestoring array divider. The first design is C-testable with only eight vectors. The additional hardware required to obtain C-testability for an n×n nonrestoring array divider consists of n-1 two-input XOR gates and one control input. The second design does not require any extra circuitry or control inputs, and is C-testable with six vectors. In other words, the basic array structure itself is C-testable. Two easily testable designs for the restoring array divider are also presented. The first n×n array design is shown to be linearly testable with 2n+8 vectors. In the second design, a logic implementation that makes the design C-testable with only six vectors is used. The extra circuitry required for both designs consists of n XOR gates and one control input

Published in:

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