By Topic

Cellular automata based synthesis of easily and fully testable FSMs

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

4 Author(s)
D. R. Chowdhury ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India ; S. Chakraborty ; B. Vamsi ; P. Pal Chaudhuri

The paper reports an application of a special class of non-group cellular automata, referred to as D1/sup */CA, as the test machine embedded in the FSM to be synthesized. The state transition properties of D1/sup */CA are exploited in designing an easy testing scheme for the finite state machine. The scheme has been found to incur a small area overhead while providing extremely high coverages close to 100% for all single stuck-at faults in the circuit.

Published in:

Computer-Aided Design, 1993. ICCAD-93. Digest of Technical Papers., 1993 IEEE/ACM International Conference on

Date of Conference:

7-11 Nov. 1993