Buffer insertion for noise and delay optimization
| Autor: | Stephen T. Quay, Anirudh Devgan, Charles J. Alpert |
|---|---|
| Rok vydání: | 1999 |
| Předmět: |
Engineering
Interconnection Delay calculation Sequential logic business.industry Computer science Logic family Elmore delay Integrated circuit design Computer Graphics and Computer-Aided Design Capacitance Bottleneck Logic gate High-level synthesis Electronic engineering Electrical and Electronic Engineering business Software Dynamic logic (digital electronics) Hardware_LOGICDESIGN Logic optimization Asynchronous circuit |
| Zdroj: | DAC |
| ISSN: | 0278-0070 |
| DOI: | 10.1109/43.806808 |
| Popis: | Interconnect-driven optimization is an increasingly important step in high-performance design. Algorithms for buffer insertion have been successfully utilized to reduce delay in global interconnect paths; however, existing techniques only optimize delay and timing slack, With the continually increasing ratio of coupling capacitance to total capacitance and the use of aggressive dynamic logic circuit families, noise analysis and avoidance is becoming a major design bottleneck. Hence, timing and noise must be simultaneously optimized to achieve maximum performance. This paper presents comprehensive buffer insertion techniques for noise and delay optimization. Three algorithms are presented, the first for noise avoidance for single sink trees, the second for avoidance for multiple sink trees, and the last for simultaneous noise and delay optimization. We prove the optimality of each algorithm (under various assumptions) and present other theoretical results as well. We ran experiments on a high-performance microprocessor design and show that our approach fixes all noise violations, Our approach was separately verified by a detailed, simulation-based noise analysis tool. Further, we show that optimizing delay alone cannot fix all of the noise violations and that the performance penalty induced by optimizing both delay and noise as opposed to only delay is less than 2%. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|