By Topic

Complexity in Electronic Switching 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
$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)
Muller, D.E. ; Digital Computer Lab., Univ. of Illinois, Urbana, Ill.

The complexity of an electronic switching circuit is defined in a sufficiently general way so that most definitions which are presently used may be included. If ¿(p, q) is the complexity of a p input q output circuit which has been minimized then we may define E(p, q) as the maximum of ¿(p, q) over all p input, q output circuits. In spite of the generality of the definition of complexity one may obtain the following inequality which gives upper and lower bounds on this maximum complexity: C12r/r¿E(p, q)¿C22r/r where r = p+log2 q. In this expression C1 and C2 are constants independent of p and q which depend upon the definition of complexity. These theoretical bounds are compared with those obtained from a few known circuiit designs.

Published in:

Electronic Computers, IRE Transactions on  (Volume:EC-5 ,  Issue: 1 )