By Topic

Graph-theoretic algorithm for finding maximal supergates in combinational logic 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
$33 $31
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)

Disjunctive decomposition of a large switching function into several smaller switching functions is an efficient way of solving many problems in logic design and testing areas. Finding disjunctive decomposition of an arbitrary switching function, however, is known to be a very difficult problem for which no practical solutions have been reported. Alternatively, a practical solution is to identify maximal supergates defined by Seth et al. (1985) which represent disjunctive decomposition of a logic circuit which realises a given switching function. An algorithm is presented which identifies maximal supergates in combinational logic circuits. The algorithm is based on both the graph-theoretic algorithms and the set manipulation algorithms such as depth-first search, biconnectivity and UNION/FIND. The time complexity of the algorithm is O(n+e), where n is the number of gates and e is the number of links between gates. Authors demonstrate experimental maximal supergates in ISCAS85 and ISCAS89 benchmark circuits

Published in:

Circuits, Devices and Systems, IEE Proceedings -  (Volume:143 ,  Issue: 6 )