Evolution of the Boolean function manipulation
Solving large systems of Boolean equations is a hard combinatorial problem. It can be greatly facilitated by preliminarily reducing the number of roots in separate equations which, in turn, leads to a reduction in the number of variables, equations and time complexity. This can have a significant ef...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | E-Article |
| Language: | English |
| Published: |
IEEE
2002
|
| Subjects: | |
| Online Access: | http://ir.unimas.my/id/eprint/16557/1/Evolution%20of%20the%20Boolean%20Function%20Manipulation%20%28abstract%29.pdf http://ir.unimas.my/id/eprint/16557/ http://ieeexplore.ieee.org/document/1033059/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Solving large systems of Boolean equations is a hard combinatorial problem. It can be greatly facilitated by preliminarily reducing the number of roots in separate equations which, in turn, leads to a reduction in the number of variables, equations and time complexity. This can have a significant effect upon the physical space and connectivity of electronic logic circuits when these are implemented using actual electronic devices or components. In this paper, we review various representation techniques, Boolean function manipulation issues and problems that are used in a practical design environment for digital systems design. |
|---|