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

Generating minimal covers of symmetric functions

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

1 Author(s)
Dietmeyer, Donald L. ; Dept. of Electr. & Comput. Eng., Wisconsin Univ., Madison, WI, USA

An algorithm is offered for generating minimum-cost, two-level expressions for totally symmetric, complete switching functions. The algorithms discussed were programmed in TurboPascal (and TurboC) and executed on an IBM PS/2-80. Many symmetric switching functions of from 7 to 15 variables were minimized and the results validated against the original specifications of the functions. Run times varied from a tenth to tens of seconds and were heavily dependent on the size of the input array and the literals of symmetry

Published in:

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

Date of Publication:

May 1993

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.