By Topic

Merging of cubes of distinct weights to minimize a multivalued logic 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

2 Author(s)
Tapia, M.A. ; Dept. of Electr. & Comput. Eng., Miami Univ., Coral Gables, FL, USA ; Guima, T.A.

A method amenable to computer programming is presented for minimizing the total amount of hardware required for realizing a partially specified multivalued logic function. The method modifies the Pomper-Armstrong algorithm (1981) for obtaining a direct cover for the function in three distinct ways. Then it extends each extendable cube in the cover toward every one of its vertices, whenever possible, so as to excite it maximally. Finally, instead of realizing a cube in the cover individually, it attempts to realize a number of cubes collectively whenever they have some specified properties. The proposed method yields an almost-minimal circuit

Published in:

Southeastcon '89. Proceedings. Energy and Information Technologies in the Southeast., IEEE

Date of Conference:

9-12 Apr 1989