首页 | 本学科首页   官方微博 | 高级检索  
     检索      

where gjset membership, variantΩ for 1less-than-or-equals, slantjless-than-or-equals, slantn−1 and arrival times for x1,x2,…,xn, we describe a cubic-time algorithm that determines a circuit for f over Ω that is of linear size and whose delay is at most 1.44 times the optimum delay plus some small constant.

Delay optimization of linear depth boolean circuits with prescribed input arrival times
Authors:Dieter Rautenbach  Christian Szegedy  Jürgen Werber  
Institution:

aForschungsinstitut für Diskrete Mathematik, Lennéstr. 2, D-53113 Bonn, Germany

Abstract:We consider boolean circuits C over the basis Ω={logical or,logical and} with inputs x1, x2,…,xn for which arrival times View the MathML source are given. For 1less-than-or-equals, slantiless-than-or-equals, slantn we define the delay of xi in C as the sum of ti and the number of gates on a longest directed path in C starting at xi. The delay of C is defined as the maximum delay of an input.Given a function of the form
f(x1,x2,…,xn)=gn−1(gn−2(…g3(g2(g1(x1,x2),x3),x4)…,xn−1),xn)
Keywords:Circuit  Straight-line program  Depth  Delay  Computer arithmetic  VLSI design
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号