By Topic

Theory and application of GF(2p) cellular automata as on-chip test pattern generator

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

7 Author(s)
Sikdar, B.K. ; Dept. of Comput. Sci. & Technol., Bengal Eng. Coll. (D.U.), West Bengal, India ; Paul, K. ; Biswas, G.P. ; Boppana, V.
more authors

This paper sets a new direction for test solution of VLSI circuits. The solution is based on the theory of extension field-that is, extension of finite field commonly referred to as Galois field (GF). The GF(2) with the set {0,1} traditionally employed in the digital domain has been extended in the present work to GF(2p) with elements from the set {0,1,2,…,2p-1}. The conventional on-chip LFSR/cellular automata (CA) based test pattern generators built around GF(2) elements have been replaced with the cellular structure of CF(2p) CA. The inter-cell connections and the value of p of a regular, modular and cascadable structure of GF(2p) CA can be tuned to maximize the fault coverage in a CUT (circuit under test). Availability of RTL/functional description of the CUT leads to a better tuning. The fault coverage figures obtained with GF(2p) CA based test pattern generator on the benchmark circuits and a few commercial circuits can be found to be significantly better than the best results reported so far with LFSR, GLFSR or GF(2) CA. The small set of uncovered faults can be handled with the introduction of a limited number of observation and test points. Area overhead for CATPG can be significantly reduced through the scheme of folding introduced in this paper

Published in:

VLSI Design, 2000. Thirteenth International Conference on

Date of Conference: