The delay of circuits whose inputs have specified arrival times

Let C be a circuit representing a straight-line program on n inputs x"1,x"2,...,x"n. If for 1=

[1]  H. James Hoover,et al.  Bounding Fan-out in Logical Networks , 1984, JACM.

[2]  Dieter Rautenbach,et al.  Delay optimization of linear depth boolean circuits with prescribed input arrival times , 2006, J. Discrete Algorithms.

[3]  Arnold Schönhage,et al.  Schnelle Multiplikation großer Zahlen , 1971, Computing.

[4]  D. H. Jacobsohn,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..

[5]  Hosahalli R. Srinivas,et al.  VLSI implementation of a 200-MHz 16/spl times/16 left-to-right carry-free multiplier in 0.35 /spl mu/m CMOS technology for next-generation DSPs , 1997, Proceedings of CICC 97 - Custom Integrated Circuits Conference.

[6]  John E. Savage,et al.  Models of computation - exploring the power of computing , 1998 .

[7]  Richard P. Brent,et al.  The Parallel Evaluation of General Arithmetic Expressions , 1974, JACM.

[8]  Shmuel Winograd,et al.  On the Time Required to Perform Addition , 1965, JACM.

[9]  P.F. Stelling,et al.  Design strategies for the final adder in a parallel multiplier , 1995, Conference Record of The Twenty-Ninth Asilomar Conference on Signals, Systems and Computers.

[10]  Chein-Wei Jen,et al.  Generalized Earliest-First Fast Addition Algorithm , 2003, IEEE Trans. Computers.

[11]  Vojin G. Oklobdzija,et al.  A Method for Speed Optimized Partial Product Reduction and Generation of Fast Parallel Multipliers Using an Algorithmic Approach , 1996, IEEE Trans. Computers.

[12]  Tomás Lang,et al.  Fast Multiplication Without Carry-Propagate Addition , 1990, IEEE Trans. Computers.

[13]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[14]  Norman P. Jouppi,et al.  Timing Analysis for nMOS VLSI , 1983, 20th Design Automation Conference Proceedings.

[15]  Richard Brent.  On the Addition of Binary Numbers , 1970, IEEE Transactions on Computers.

[16]  Vojin G. Oklobdzija,et al.  Improving multiplier design by using improved column compression tree and optimized final adder in CMOS technology , 1995, IEEE Trans. Very Large Scale Integr. Syst..

[17]  Jianhua Liu,et al.  An Algorithmic Approach for Generic Parallel Adders , 2003, ICCAD 2003.

[18]  David E. Muller,et al.  Restructuring of Arithmetic Expressions For Parallel Evaluation , 1976, JACM.

[19]  Vojin G. Oklobdzija,et al.  Multiplier design utilizing improved column compression tree and optimized final adder in CMOS technology , 1993, 1993 International Symposium on VLSI Technology, Systems, and Applications Proceedings of Technical Papers.

[20]  Robert B. Hitchcock,et al.  Timing verification and the timing analysis program , 1988, DAC 1982.

[21]  David E. Muller,et al.  Reduction of Depth of Boolean Networks with a Fan-In Constraint , 1977, IEEE Transactions on Computers.

[22]  Andreas Jakoby,et al.  Circuit complexity: from the worst case to the average case , 1994, STOC '94.

[23]  Yuri Petrovich Ofman,et al.  On the Algorithmic Complexity of Discrete Functions , 1962 .

[24]  David E. Muller,et al.  Efficient Parallel Evaluation of Boolean Expressions , 1976, IEEE Transactions on Computers.

[25]  Kiyoshi Maruyama,et al.  The Parallel Evaluation of Arithmetic Expressions Without Division , 1973, IEEE Transactions on Computers.

[26]  Robert B. Hitchcock,et al.  Timing Analysis of Computer Hardware , 1982, IBM J. Res. Dev..