Simultaneous Circuit Transformation and Routing

Authors:
Hiroaki Yoshida;Motohiro Sera;Masao Kubo;Masahiro Fujita
Affiliations:
Department of Electronic Engineering, University of Tokyo;Department of Electronic Engineering, University of Tokyo;Department of Electronic Engineering, University of Tokyo;Department of Electronic Engineering, University of Tokyo
Venue:
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Year:
2002

Citing 5
Cited 0

Implicit and incremental computation of primes and essential primes of Boolean functions

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Post-layout logic restructuring for performance optimization

DAC '97 Proceedings of the 34th annual Design Automation Conference
Exact switchbox routing with search space reduction

ISPD '00 Proceedings of the 2000 international symposium on Physical design
Logic Minimization Algorithms for VLSI Synthesis

Logic Minimization Algorithms for VLSI Synthesis
Wire reconnections based on implication flow graph

Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new methodology to integrate circuit transformation into routing. More specifically, this paper shows an approach for performing routing and wire reconnection simultaneously. To accomplish this, we introduce a new logic representation that implements all possible wire reconnections implicitly by enhancing global flow optimization techniques. Since our method takes into account circuit transformation during routing phase where the accurate physical information is available, we can obtain better results than the conventional routing algorithms. In addition, we can succeed in routing even if other routers like rip-up and reroute methods fail. The algorithm has been implemented and the experimental results are presented. We believe this is the first approach which combines them completely.