Timing analysis and optimization is one of the key areas in modern VLSI design and has become bottleneck in designing multi-million gate systems. Consequently, computer-aided design research in this area has shown in a new renaissance after the advent of deep sub-micron IC technology and the accompanying restrictive performance constraints. Effects related to interconnect dominance has resulted in technical problems in areas such as floorplanning, placement, routing and performance prediction, and therefore has made accurate and effective timing analysis and optimization more challenging. The current special issue of VLSI DESIGN Journal is devoted to papers that provide high-quality ideas and results in critical areas related to the timing analysis and optimization for deep sub-micron IC. The first paper called, “Timing Challenges for Very Deep Sub-Micron (VDSM) IC” is by Lin et al. The paper presents current and future timing challenges for VDSM IC. It presents why traditional design flow failed in timing sign-off and how silicon-accurate timing tools are necessary to overcome timing challenges and limitations that cause timing convergence and capacity problems in VDSM IC technology. The second paper is by Dhaou et al. Its title is “Energy Efficient Signaling in DSM Technology.” The key idea is to combat crosstalk noise and to reduce the power consumption while driving the global wire at an optimal delay by reducing voltage swing with buffer insertion and resizing. In 0.25mm CMOS, over 60% of energy-saving can be achieved if supply voltage is reduced from 2.5 down to 1.5 V. The third paper is written by Chen et al., entitled “Simultaneous Buffer-Sizing and Wire-Sizing for Clock Tress Based on Lagrangian Relaxation.” In this paper, a Lagrangian relaxation algorithm for simultaneously optimizing delay, power, skew, area, and sensitivity in clock tree is presented. The effectiveness and accuracy of algorithm is demonstrated. The fourth paper is by Hu et al. Its title is “Performance Driven Global Routing Through Gradual Refinement.” The authors present a heuristic for interconnect global routing that can optimize routing congestion, delay and the number of bends that are oftenly competing objectives. In addition to exploiting timing constrained routing flexibility, a gradual refinement method is applied for simultaneous optimization on congestion, timing and the number of bends. Experiments on benchmarks confirm the effectiveness of this method. The fifth paper is written by Arunachalam et al and is entitled “Accurate Coupling-Centric Timing Analysis Incorporating Temporal and Functional Isolation.” This paper presents a timing analysis methodology TACO that can accurately bind the arrival times in the presence of coupling. The timing windows at the aggressor can be used to determine whether the aggressor can switch in conjunction with the victim. Results of industrial examples show that the proposed method actually helps in reducing pessimism in the timing analysis. The sixth paper is authored by Lee et al. and is entitled “CMOS Delay and Power Model Equations for Simultaneous Transistor and Interconnect Wire Analysis and Optimization.” Generalized delay and power equations are proposed in this paper for CMOS circuit optimization achieved by transistor and interconnect minimization. The equations help analyze the entire power-delay trade-off with less complexity and fast computation time. The seventh paper is written by Huang and is entitled “Improving the Timing of Extended Finite State Machines via Catalyst.” In this paper, a timing optimization technique for a complex finite state machine that consists of random logic and data operator is presented. The proposed technique based on the concept of catalyst adds a functionally redundant block to the original circuit so the timing critical paths are divided for speed improvement. The eighth paper is by Huang et al. Its title is “TimingDriven-Testable Convergent Tree Adders.” The tree structure of adders is normally unbalanced and therefore generates high fanout in timing critical paths that may cause racing and increase the delay. A timing optimization
Read full abstract