TY - GEN
T1 - On improved graph-based alternative wiring scheme for multi-level logic optimization
AU - Wu, Yu-Liang
AU - Sze, Chin-Ngai
AU - Cheung, Chak-Chung
AU - Fan, Hongbing
PY - 2000
Y1 - 2000
N2 - A much extended Graph-Based Alternative Wiring (GBAW) scheme to identify alternative wires in multilevel logic with promising results is presented. By modeling subsets of circuits as minimal graphs and applying purely graph-based local pattern search technique, we have found more than 40 graph patterns which contain alternative wires within 2-edge distance from the target wire. Applying proper grouping technique for the similar patterns, the complexity of our rewiring technique can be reduced. Experimental results on MCNC benchmarks show that our technique is much faster than the ATPG-based technique RAMBO with competitive number of alternative wires found. With this augmented pattern family of alternative wires, we are able to find 30% more alternative wires compared to RAMBO with 75 times speedup on average. We applied GBAW in logic minimization as a perturbation engine and simplify the target circuit by SIS algebraic operations. Results show a further reduction of 11.1 % in literal count compared to applying algebraic operations alone. © 2000 IEEE.
AB - A much extended Graph-Based Alternative Wiring (GBAW) scheme to identify alternative wires in multilevel logic with promising results is presented. By modeling subsets of circuits as minimal graphs and applying purely graph-based local pattern search technique, we have found more than 40 graph patterns which contain alternative wires within 2-edge distance from the target wire. Applying proper grouping technique for the similar patterns, the complexity of our rewiring technique can be reduced. Experimental results on MCNC benchmarks show that our technique is much faster than the ATPG-based technique RAMBO with competitive number of alternative wires found. With this augmented pattern family of alternative wires, we are able to find 30% more alternative wires compared to RAMBO with 75 times speedup on average. We applied GBAW in logic minimization as a perturbation engine and simplify the target circuit by SIS algebraic operations. Results show a further reduction of 11.1 % in literal count compared to applying algebraic operations alone. © 2000 IEEE.
UR - https://www.scopus.com/pages/publications/48349093895
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-48349093895&origin=recordpage
U2 - 10.1109/ICECS.2000.912962
DO - 10.1109/ICECS.2000.912962
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 0780365429
SN - 9780780365421
VL - 2
SP - 654
EP - 657
BT - Proceedings of the IEEE International Conference on Electronics, Circuits, and Systems
T2 - 7th IEEE International Conference on Electronics, Circuits and Systems, ICECS 2000
Y2 - 17 December 2000 through 20 December 2000
ER -