Minimization of Boolean expressions using matrix algebra
| dc.contributor.author | Schwender, Holger | |
| dc.date.accessioned | 2007-05-25T10:45:15Z | |
| dc.date.available | 2007-05-25T10:45:15Z | |
| dc.date.issued | 2007-05-25T10:45:15Z | |
| dc.description.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. | en |
| dc.identifier.uri | http://hdl.handle.net/2003/24310 | |
| dc.identifier.uri | http://dx.doi.org/10.17877/DE290R-265 | |
| dc.language.iso | en | de |
| dc.subject | Binary variable | en |
| dc.subject | Logic expression | en |
| dc.subject | Matrix algebra | en |
| dc.subject.ddc | 004 | |
| dc.title | Minimization of Boolean expressions using matrix algebra | en |
| dc.type | Text | de |
| dc.type.publicationtype | report | en |
| dcterms.accessRights | open access |