By Topic

Symbolic cover minimization of fully I/O specified 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
$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

1 Author(s)
D. Drusinsky-Yoresh ; Sony Corp., Kanagawa, Japan

Currently, symbolic cover minimization is computed using multiple-valued-logic minimization. This problem, however, is computationally intractable, so less accurate heuristics are used. An alternative approach to computationally intractable problems is to reduce their generality so that the simpler problem has a tractable solution. Accordingly, a deterministic approach for the symbolic cover minimization problem for fully input/output (I/O) specified finite state machines (FSMs) is presented. A uniqueness theorem for a hierarchical extension of FSMs is proved, and the theorem is used to derive the proposed technique

Published in:

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