Cart (Loading....) | Create Account
Close category search window

An Algorithm to Dualize a Regular Switching Function

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

3 Author(s)
Hammer, P.L. ; Department of Combinatorics and Optimization, University of Waterloo ; Peled, U.N. ; Pollatschek, M.A.

Given a monotone (nondecreasing) switching function F(x1,···,xn), its prime implicants are the minimal infeasible points, i.e., the minimal solutions to F(x) = 1. A monotone F is regular ifany "right shift" of a feasible point is again feasible. The roofs of a regular function F are those prime implicants al ofwhose right shifts are feasible. The set of these roofs completely determines F. An algorithm is presented to compute the roofs of the dual Boolean function Fd= F̄(x̄) This computation is needed, for example, in the synthesis problem ofthreshold logic. The algorithm "scans" all the 2npoints in lexicographical order, skipping over intervals which are clearly roof-free. The amount of this work is proportional to the number of prime implicants of F. Encouraging computational experience is reported.

Published in:

Computers, IEEE Transactions on  (Volume:C-28 ,  Issue: 3 )

Date of Publication:

March 1979

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.