ACM Home Page
Please provide us with feedback. Feedback
Layout-driven Timing Optimization by Generalized De Morgan Transform
Full text Publisher SitePublisher Site PdfPdf (158 KB)
Source Asia and South Pacific Design Automation Conference archive
Proceedings of the 2002 Asia and South Pacific Design Automation Conference table of contents
Page: 647  
Year of Publication: 2002
ISBN:0-7695-1441-3
Authors
Supratik Chakraborty  Dept. of Computer Science and Engineering, Indian Institute of Technology, Bombay, India
Rajeev Murgai  Fujitsu Laboratories of America, Inc., Sunnyvale, CA
Sponsor
SIGDA: ACM Special Interest Group on Design Automation
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 13,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  

ABSTRACT

We propose a timing-oriented logic optimization technique called Generalized De Morgan (GDM) transform, that integrates gate resizing, net buffering and De Morgan transformation. The contribution of our work lies in the integration of the three techniques, allowing them to interact at a much finer level of granularity than would be otherwise possible. This produces better results than those obtainable by individual techniques like net buffering or gate resizing applied to the circuit in various combinations. GDM transform is also layout-friendly since it does not alter the routing patterns and placement of cells, except possibly some buffer insertions/deletions. Hence it is useful for achieving timing closure in late stages of the design flow. We propose a comprehensive GDM algorithm that (a) determines the best replacement of a gate, possibly with inverted inputs and outputs, along with the best buffering configurations of nets incident on it, and (b) embeds this into a global scheme for optimizing large designs. We have implemented this algorithm in a layout-driven, industrial-strength logic optimization framework, and have successfully applied it to large industrial designs.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
 
5
 
6
[6] R. Carragher, R. Murgai, S. Chakraborty, M. Prasad, A. Srivastava, and N. Vemuri. Layout-driven logic optimization. In Proceedings of the International Workshop on Logic Synthesis, pages 270-276, June 2000.
7
 
8
 
9
[9] J. P. Fishburn and A. E. Dunlop. TILOS: A Posynomial Programming Approach to Transistor Sizing. In Proceedings of the International Conference on Computer-Aided Design, pages 326-328. IEEE, 1985.
10
 
11
[11] T. Ishioka, M. Murofushi, and M. Murakata. Layout Driven Delay Optimization With Logic Re-synthesis. In Workshop Notes of the International Workshop on Logic Synthesis, 1997.
12
13
 
14
 
15
[15] L. P. P. P. van Ginneken. Buffer Placement in Distributed RC-tree Networks for Minimum Elmore Delay. In Proceedings of the International Symposium on Circuits and Systems, pages 865- 868, 1990.
 
16
 
17
 
18
[18] S. S. Sapatnekar, V. Rao, P. Vaidya, and S. Kang. An exact solution to the transistor sizing problem for cmos circuits using convex optimization. IEEE Transactions on Computer-Aided Design, CAD-6(6):1621-1634, Nov. 1993.
 
19
[19] H. Savoj, K. Xiang, K. Pan, and A. Domic. Technology dependent timing optimization. In Proceedings of the International Workshop on Logic Synthesis, June 1997.
 
20
 
21
 
22

Collaborative Colleagues:
Supratik Chakraborty: colleagues
Rajeev Murgai: colleagues