By Topic

An architecture for synthesis of testable finite state machines

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)
Agrawal, V.D. ; AT&T Bell Labs., Murray Hill, NJ, USA ; Kwang-Ting Cheng

The authors present a hardware architecture for synthesizing finite state machines (FSM). This architecture is defined at the level of the state transition graph. It contains a test machine with the same number of state variables as the object machine to be synthesized. The state graph of the test machine is so defined that each state is uniquely set and observed by an input sequence no longer than [logk n], where n is the number of states and the integer k is a design parameter. The state transition graph of the test machine is superposed on the given state graph of the object function. The logic implementation steps, namely, state assignment, minimization and technology mapping are carried out for the combined graph. By design, the embedded test machine is fully testable. Also, since the test machine can control all memory elements, the circuit is effectively tested by a combinational circuit test generator. Scan register is shown to be a special case of the presented methodology

Published in:

Design Automation Conference, 1990., EDAC. Proceedings of the European

Date of Conference:

12-15 Mar 1990