Using GF2 Matrices to Simplify Boolean Logic
| dc.contributor.author | Maurer, Peter M. | |
| dc.date.accessioned | 2009-01-23T19:40:41Z | |
| dc.date.available | 2009-01-23T19:40:41Z | |
| dc.date.issued | 2009-01-23T19:40:41Z | |
| 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.format.extent | 33701 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.identifier.uri | http://hdl.handle.net/2104/5264 | |
| dc.language.iso | en_US | |
| dc.license | GPL | en |
| dc.subject | Design Automation | en |
| dc.subject | Logic Synthesis | en |
| dc.title | Using GF2 Matrices to Simplify Boolean Logic | en |