This article is cited in 5 papers

On one of the possibilities of sharpening estimates for the delay of a parallel adder

V. M. Khrapchenko

M. V. Keldysh Institute for Applied Mathematics, Russian Academy of Sciences

Abstract: A nontrivial lower bound to the delay of a parallel adder over the classical basis $\textrm B_0=\{\&,\lor,{^-}\}$ is obtained with the additive remainder term of order $\log\log\log n$.

Received: 01.06.2007

 English version: Journal of Applied and Industrial Mathematics, 2008, 2:2, 211–214

Bibliographic databases:

• 
•