Treffer: A New Approach to Simplifying Boolean Functions
Title:
A New Approach to Simplifying Boolean Functions
Authors:
Source:
The Journal of Engineering Research, Vol 1, Iss 1, Pp 39-45 (2004)
Publisher Information:
Sultan Qaboos University, 2004.
Publication Year:
2004
Subject Terms:
Boolean network, Chip, tabulation method, map-tabulation, karnaugh map, 02 engineering and technology, Standard Boolean model, Boolean function, FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Filtered algebra, Boolean circuit, Algebra over a field, Boolean expression, Automated Software Testing Techniques, Pure mathematics, Engineering (General). Civil engineering (General), Computer science, Two-element Boolean algebra, And-inverter graph, Control Barrier Functions, Algorithm, Computational Theory and Mathematics, Computer Science, Physical Sciences, Telecommunications, Product term, TA1-2040, Circuit minimization for Boolean functions, Software, Mathematics, Formal Methods in Software Verification and Control
Document Type:
Fachzeitschrift
Article<br />Other literature type
ISSN:
1726-6742
1726-6009
1726-6009
DOI:
10.24200/tjer.vol1iss1pp39-45
DOI:
10.60692/teeay-a7c27
DOI:
10.60692/b5zr7-j6680
Access URL:
Rights:
CC BY ND
CC BY
CC BY
Accession Number:
edsair.doi.dedup.....bda18c20e8a8fcc8f9c9b71b93ca0d97
Database:
OpenAIRE
Weitere Informationen
There are many benefits to simplifying Boolean functions before they are implemented in hardware. A reduced number of gates decreases considerably the cost of the hardware, reduces the heat generated by the chip and, most importantly, increases the speed. But no method is effective for the simplification of Boolean functions, if it involves more than six variables. This paper presents a new manual method of simplification that can be effectively applied to problems with a large number of variables.