Show simple item record

dc.contributor.authorMaurer, Peter M.
dc.date.accessioned2009-01-23T19:40:41Z
dc.date.available2009-01-23T19:40:41Z
dc.date.issued2009-01-23T19:40:41Z
dc.identifier.urihttp://hdl.handle.net/2104/5264
dc.description.abstractConventional 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.format.extent33701 bytes
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.subjectDesign Automationen
dc.subjectLogic Synthesisen
dc.titleUsing GF2 Matrices to Simplify Boolean Logicen
dc.licenseGPLen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record