论文信息 - Delay optimization of linear depth boolean circuits with prescribed input arrival times

Delay optimization of linear depth boolean circuits with prescribed input arrival times

We consider boolean circuits C over the basis @W={@?,@?} with inputs x"1, x"2,...,x"n for which arrival times t"1,t"2,...,t"[email protected]?N"0 are given. For 1=

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

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

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

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

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

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

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

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

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