Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Maxterm Type Expressions of Switching Functions and Their Prime Implicants

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)
Das, S.R. ; Institute of Radio Physics and Electronics, University of Calcutta, India. ; Choudhury, A.K.

One of the basic problems of combinational switching circuit theory is that of designing circuits with a minimum number of AND-gates or prime implicants. Algorithms have been formulated for this purpose which first generate all possible prime implicants corresponding to a specified switching function and then select minimal subsets of these prime implicants for use in the formation of the minimal networks [1]-[6]. In practically all the currently available methods of simplification of switching functions, use is made of the minterm type expression specified in the algebraic or its equivalent binary or decimal form. Operations with binary or decimal numbers have become very popular because of their inherent advantages.

Published in:

Electronic Computers, IEEE Transactions on  (Volume:EC-14 ,  Issue: 6 )