The complexity of Boolean functions
The complexity of Boolean functions
Digital design principles and practices
Digital design principles and practices
Contemporary logic design
On Theorem-Proving in Horn Theories with Built-in Algebras
AISMC-3 Proceedings of the International Conference AISMC-3 on Artificial Intelligence and Symbolic Mathematical Computation
| Hi-index | 0.00 |
A rewriting based method to design circuits on FPLA electronic devices is presented. It is an improvement of our previous work. In comparison with this latter, the number of boolean vectors generated during the design process is reduced. This is done thanks to new forms of rewriting rules denoting new interesting properties on boolean vectors, associated to boolean products. Only boolean products which are implicants of the circuit to design are computed. Thus, this new design process is more efficient than the previous one.