Using GF2 Matrices to Simplify Boolean Logic

DSpace/Manakin Repository

BEARdocs is currently undergoing a scheduled upgrade. We expect the upgrade to be completed no later than Monday, March 2nd, 2015. During this time you will be able to access existing documents, but will not be able to log in or submit new documents.

Show simple item record Maurer, Peter M.
dc.description.abstract Conventional logic simplification can be couched in terms of singular GF(2) matrices. The advantage to doing this is that different matrices can be used to combine terms that are separated by a Hamming distance greater than one. Although this sort of thing can be done without matrices, it is not clear what one would do after finding such terms. We show that by applying a matrix transformation to the inputs of a function, we can combine terms that are at arbitrary distances. We also show that we can further simplify functions by transforming the input vector space with a non-singular transformation. en
dc.subject Design Automation en
dc.subject Logic Synthesis en
dc.title Using GF2 Matrices to Simplify Boolean Logic en
dc.license GPL en

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search BEARdocs

Advanced Search


My Account