By Topic

Design of multiple attractor GF(2p) cellular automata for diagnosis of VLSI 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
$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)
Sikdar, B.K. ; Dept. of Comput. Sci. & Technol., Bengal Eng. Coll., Howrah, India ; Ganguly, N. ; Majumder, P. ; Chauhuri, P.P.

This paper introduces an efficient diagnosis scheme for VLSI circuits. A special class of non-group CA referred to as multiple attractor cellular automats (MACA) is introduced to diagnose the faulty block of a circuit under test (CUT). The scheme employs significantly lesser memory than the existing methods reported so far. Experimental results establish the efficiency of the scheme in terms of saving in memory space and execution time and enhanced diagnostic resolution. Rather than GF(2) CA where each CA cell handles GF(2) elements (0 and 1), the GF(2p) CA is employed to reduce the processing time

Published in:

VLSI Design, 2001. Fourteenth International Conference on

Date of Conference:

2001