Towards Efficient Calculation of Information Measures for Reordering of Binary Decision Diagrams
| dc.creator | Popel, Denis V. | |
| dc.date | 2002-07-05 | |
| dc.date.accessioned | 2026-07-07T08:36:04Z | |
| dc.date.available | 2026-07-07T08:36:04Z | |
| dc.description | This paper introduces new technique for efficient calculation of different Shannon information measures which operates Binary Decision Diagrams (BDDs). We offer an algorithm of BDD reordering which demonstrates the improvement of the obtaining outcomes over the existing reordering approaches. The technique and the reordering algorithm have been implemented, and the results on circuits' benchmarks are analyzed. We point out that the results are quite promising, the algorithm is very fast, and it is easy to implement. Finally, we show that our approach to BDD reordering can yield to reduction in the power dissipation for the circuits derived from BDDs. | |
| dc.description | 4 pages, 3 figures, 2 tables, SCS'01 | |
| dc.identifier | https://arxiv.org/abs/cs/0207020 | |
| dc.identifier | http://arxiv.org/abs/cs/0207020 | |
| dc.identifier | SCS 2001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/139946 | |
| dc.subject | Other Computer Science | |
| dc.subject | B.6.3 | |
| dc.title | Towards Efficient Calculation of Information Measures for Reordering of Binary Decision Diagrams | |
| dc.type | text |