Authors: Yanushkevic, Svetlana
Popel, Denis
Shmerko, Vlad
Cheushev, Vasily
Stanković, Radomir 
Title: Information theoretic approach to minimization of polynomial expressions over GF(4)
Journal: Proceedings of The International Symposium on Multiple-Valued Logic
First page: 265
Last page: 270
Conference: 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000); 25-25 May 2000; Portland, OR, USA
Issue Date: 1-Jan-2000
Rank: M30
ISBN: 978-0-7695-0692-5
ISSN: 0195-623X
DOI: 10.1109/ISMVL.2000.848630
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.
Publisher: IEEE

Show full item record


checked on Apr 22, 2024

Page view(s)

checked on Apr 23, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.