|
Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >
Fast Generation of Prime-Irredundant Covers from Binary Decision Diagrams
| Title: | Fast Generation of Prime-Irredundant Covers from Binary Decision Diagrams |
| Authors: | Minato, Shin-ichi Browse this author →KAKEN DB |
| Keywords: | BDDs (Binary Decision Diagrams) | | prime-irredundant covers | | Boolean functions | | sum-of-products forms | | logic synthesis |
| Issue Date: | 25-Jun-1993 |
| Publisher: | 電子情報通信学会 |
| Journal Title: | IEICE transactions on fundamentals of electronics, communications and computer sciences |
| Volume: | E76 |
| Issue: | A6 |
| Start Page: | 967 |
| End Page: | 973 |
| Abstract: | Manipulation of Boolean functions is one of the most important techniques for implementing of VLSI logic design systems. This paper presents a fast method for generating prime-irredundant covers from Binary Decision Diagrams (BDDs), which are efficient representation of Boolean functions. Prime-irredundant covers are forms in which each cube is a prime implicant and no cube can be eliminated. This new method generates compact cube sets from BDDs directly, in contrast to the conventional cube set reduction algorithms, which commonly manipulate redundant cube sets or truth tables. Our method is based on the idea of a recursive operator, proposed by Morreale. Morreale's algorithm is also based on cube set manipulation. We found that the algorithm can be improved and rearranged to fit BDD operations efficiently. The experimental results demonstrate that our method is efficient in terms of time and space. In practical time, we can generate cube sets consisting of more than 1,000,000 literals from multi-level logic circuits which have never previously been flattened into two-level logics. Our method is more than 10 times faster than ESPRESSO in largescale examples. It gives quasi-minimum numbers of cubes and literals. This method should find many useful applications in logic design systems. |
| Rights: | copyright©1993 IEICE |
| Type: | article |
| URI: | http://hdl.handle.net/2115/47468 |
| Appears in Collections: | 情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)
|
Submitter: 湊 真一
|
