Recenily, seveml design auiomaiion approaches for delay and skew minimization of clock nets have been proposed. These approaches are based upon varying the widths and lengths of the clock tree wires io minimize skew and sometimes delay. Most of these iechniques do noi consider the clock iree power dissipation, occupied area, or the reliabiliiy of ihe resvlts with regard to the ineviiable process variations. In this paper, concurreni buffer insertion and global wire width adjusimenis are used to reliably reduce both delay and power from that obtained for a reliable buflerless soluiion. Moreover, in spite of ihe belief ihai ihe mismaich in bufler delays can resuli in significant clock skew, our resulis show ihai buflers can actually reduce the process dependent skew for a reliable design.

ZusammenfassungOptimal Initial Approximations for the Newton-Raphson Division Algorithm. Newton-Raphson iteration provides a high-speed method for performing division. The Newton-Raphson division algorithm begins with an initial approximation to the reciprocal of the divisor. This value is iteratively refined until a specified accuracy is achieved. In this paper, we develop methods for selecting constant and linear approximations which minimize the maximum absolute error of the final result. These approximations are compared with previous methods which minimize the maximum relative error in the final result or the maximum absolute error in the initial value.Optimale AnfangsnJlherungen fiir den Newton-Raphson Divisionsalgorithmus. Die Newton-Raphson Iteration, die eine schnelle Division gestattet, beginnt mit einer Anfangsn~iherung ffir den Kehrwert des Divisors. Dieser Wert wird iterativ verbessert, bis die vorgegebene Genauigkeit erreicht ist. In der Arbeit wird die Auswahl von konstanten und linearen N~herungen beschrieben, die den maximalen Absolutfehler des Endergebnisses minimieren. Diese N~iherungen werden mit vorliegenden Veffahren verglieben, bei denen der maximale Relativfehler im Endergebnis oder der maximale Absoluffehler der Anfangsniiherung minimiert wird. iteration as an intermediate step in its short reciprocal algorithm [6]. A dual of the Newton-Raphson division algorithm, known as the division-by-convergence method, is implemented on the IBM 360/91 [7]. The Newton-Raphson division algorithm computes the reciprocal of the divisor d by the following iterative equation [1]