Decomposition of Boolean Functions for BDD |
|
|
Authors |
| Bibilo P.N. |
Date of publication |
| 2010 |
|
Abstract |
| The method for decomposition of full defined system Boolean functions for two-piece partition of set arguments and algorithm for the partitioned arguments are suggested in the paper. The given system of functions is represented by BDD, and it helps to select partitioned arguments and to make decomposition. The results of experimental researches for efficient decomposition procedures of logical circuits synthesis are represented. |
Keywords |
| Boolean functions, decomposition, binary decision diagram (BDD), gate array |
Library reference |
| Bibilo P.N. Decomposition of Boolean Functions for BDD // Problems of Perspective Micro- and Nanoelectronic Systems Development - 2010. Proceedings / edited by A. Stempkovsky, Moscow, IPPM RAS, 2010. P. 2-7. |
URL of paper |
| http://www.mes-conference.ru/data/year2010/papers/m10-17-48911.pdf |