By Topic

Direct cover MVL minimization with cost-tables

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)
Dueck, G.W. ; Dept. of Electr. & Comput. Eng., US Naval Postgraduate Sch., Monterey, CA, USA

A direct cover algorithm for minimizing multivalued logic functions is described. The use of cost tables facilitates cost efficient implementations. Current-mode CMOS circuits are considered as target implementations. However, the algorithm can be readily adapted to different technologies by making appropriate changes in the cost tables. Previous direct cover methods selected the most isolated minterm to be covered first. Empirical results show that it is advantageous to start with the most clustered minterm. The number of implicants which have to be considered to cover a selected minterm increases greatly when universal literals are used (as opposed to window literals). Therefore, it is essential to limit the entries in the cost tables. A novel link field, associated with each cost table entry, reduces the number of implicants considered to cover a selected minterm. Two metrics are used when choosing an implicant: cost efficiency and function complexity

Published in:

Multiple-Valued Logic, 1992. Proceedings., Twenty-Second International Symposium on

Date of Conference:

27-29 May 1992