Wire reconnections based on implication flow graph

Authors:
Shih Chieh Chang;Zhong Zhen Wu;He Zhe Yu
Affiliations:
National Chung-Cheng University, Chia-Yi, Taiwan R.O.C.;National Chung-Cheng University, Chia-Yi, Taiwan R.O.C.;National Chung-Cheng University, Chia-Yi, Taiwan R.O.C.
Venue:
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Year:
2000

Citing 4
Cited 1

Multi-level logic optimization by implication analysis

ICCAD '94 Proceedings of the 1994 IEEE/ACM international conference on Computer-aided design
Logic optimization by an improved sequential redundancy addition and removal techniques

ASP-DAC '95 Proceedings of the 1995 Asia and South Pacific Design Automation Conference
Dual Global Flow

ICCD '91 Proceedings of the 1991 IEEE International Conference on Computer Design on VLSI in Computer & Processors
Perturb and simplify: multilevel Boolean network optimizer

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Simultaneous Circuit Transformation and Routing

ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Global Flow Optimization (GFO) can perform the fanout/fanin wire re-connections by modeling the problem of the wire reconnections by a flow graph and then solving the problem using the maxflow-mincut algorithm on the flow graph. However, the flow graph cannot fully characterize the wire re-connections which causes GFO to lose optimality on several obvious cases. In addition, we find that the fanin re-connection can have more optimization power than the fanout re-connection but requires more sophisticated modeling. In this paper, we re-formulate the problem of the fanout/fanin re-connections by a new graph called the implication flow graph. We show that the problem of wire re-connections on the implication flow graph is NP complete and also propose an efficient heuristic on the new graph. Our experimental results are very exciting.