Eliminating wire crossings for molecular quantum-dot cellular automata implementation
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
On approximating the maximum simple sharing problem
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 0.00 |
In this paper, we propose a novel compact BDD structure, calledNon-crossing ordered BDD(NCOBDD), that can be mapped directly to aregular circuit structure. Compared with other BDD-based regularstructures, NCOBDD-mapped circuits reduce the costs of area, powerand latency, while preserving the regularity of the structures. Wealso present an algorithm that uses a top-down level-by-level sweepto construct minimal NCOBDDs. Experimental results show that forasymmetric benchmark circuits, the average reduction on area, powerand latency are 61.6%, 53.1% and 69.2%, respectively, compared withYet Another Decision Diagram (YADD) [9].