Authors: | Schwender, Holger |
Title: | Minimization of Boolean expressions using matrix algebra |
Language (ISO): | en |
Abstract: | The more variables a logic expression contain, the more complicated is the interpretation of this expression. Since in a statistical sense prime implicants can be interpreted as interactions of binary variables, it is thus advantageous to convert such a logic expression into a disjunctive normal form consisting of prime implicants. In this paper, we present two algorithms based on matrix algebra for the identification of all prime implicants comprised in a logic expression and for the minimization of this set of prime implicants. |
Subject Headings: | Binary variable Logic expression Matrix algebra |
URI: | http://hdl.handle.net/2003/24310 http://dx.doi.org/10.17877/DE290R-265 |
Issue Date: | 2007-05-25T10:45:15Z |
Appears in Collections: | Sonderforschungsbereich (SFB) 475 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
tr09-07.pdf | DNB | 215.8 kB | Adobe PDF | View/Open |
This item is protected by original copyright |
This item is protected by original copyright rightsstatements.org