Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

Information theoretic approach to minimization of polynomial expressions over GF(4)

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

5 Author(s)
Yanushkevich, S.N. ; Fac. of Comput. Sci. & Inf. Syst., Tech. Univ. Szczecin, Poland ; Popel, D. ; Shmerko, V. ; Cheushev, V.
more authors

This paper addresses a new information theoretic approach to minimization of polynomial expressions for Multiple Valued Logic (MVL) functions. Its focus is to determine the so-called pseudo Reed-Muller and pseudo Kronecker expressions of MVL functions. A key point of our approach is the use of information theoretic measures for efficient design of Decision Trees (DTs) to represent MVL functions. We utilize free pseudo Reed-Muller GF(4) (PSDRMGF) DTs and free pseudo Kronecker GF(4) (PSDKGF) DTs. Furthermore, we show that the suggested approach allows to manage the process of minimization in a simple way, for the most of known forms of logic function representation. Our program, Info-MV, produces, in most cases, the extremely better results, in contrast to some known heuristic minimization strategies

Published in:

Multiple-Valued Logic, 2000. (ISMVL 2000) Proceedings. 30th IEEE International Symposium on

Date of Conference:

2000