By Topic

On the Minimization of Tree-Type Universal 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
$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)
Cheung, C.C. ; Department of Electrical and Computer Engineering, University of Massachusetts ; Ehrich, R.W.

The realization of arbitrary switching functions using the universal logic modules of Yau and Tang [1], [2] has the disadvantage that, in general, large trees of modules result. A decomposition theorem and an algorithm are given for reducing the size of such trees, using what is called a chain decomposition.

Published in:

Computers, IEEE Transactions on  (Volume:C-24 ,  Issue: 11 )