V. Krapchenko. Asymptotic estimation of addition time of a parallel adder. Syst. Theory Res., 19:105--222, 1970. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Probabilistic Parallel Prefix Computation - Reif (1993) (10 citations) (Correct)
....Air Force Contract AFOSR87 0386, DARPA ISTO Contract N00014 88 K 0458 and N00014 91 J 1985, NASA Subcontract 550 63 of Primecontract NAS5 30428. Approved for public release: distribution is unlimited. lol 102 . H. carry completion testing. The best known constant fan in circuit for addition [10] employs a complicated variant of the carry look ahead method, has linear size and f(log n) depth with no improvement for random inputs. In fact, for any of the above arithmetic operations over random input, the best known constant fan in circuits have f(logn) depth. Recently, Chandra, Fortune and ....
V.M. Krapchenko, Asymptotic estimation of addition time of a parallel adder., Syst. Theory Res. (Probl. Kibern. 19, 107-122 (}{uss.)) 19, 105-122 (1970).
Parallel Algorithmic Techniques for Combinatorial Computation - Eppstein, Galil (1988) (26 citations) (Correct)
....after each input string prefix. This algorithm for finite automaton simulation was used by Ladner and Fischer [42] to define Boolean circuits of size O(n) for adding two binary numbers, each n bits long, in time O(log n) similar circuits had previously been described by O#man [55] and Krapchenko [39]. 2.3 Ranking We have seen that prefix computation is useful in a great variety of circumstances. But often we have sequences of values represented as linked lists, and the techniques above can not handle this. Here we describe techniques for prefix computation on linked lists. In particular we ....
A.N. Krapchenko, Asymptotic Estimation of Addition Time of a Parallel Adder. English translation in Syst. Theory Res. 19, 1970, 105--122.
Design, Analysis and Implementation of an Adder by Ladner and.. - Minimair (1994) (Correct)
....in order to obtain bounds on the complexity of the addition function. In this section there is also a theorem about the optimal size of the addition function stated (cf. 9] Moreover there can be found a table containing the depths and sizes of several known adders (cf. 1] 8] 10] 11] [4], 5] 12] Section 3 contains the design and analysis of the adder by Ladner and Fisher according to [5] In subsection 3.1 the general design of the adder is presented. The parallel algorithm solving the problem of adding two n bit binary numbers is developed step by step in the frame of ....
....in [6] as Wegener writes in [12] Theorem 2. 4 [6] Let f 2 Bn be non degenerated, then n Gamma 1 C(f) adder depth size Brent [1] log 2 n O( p log 2 n) O(nlog 2 n) Carry Look Ahead [8] O(log 2 n) O(n) Conditional Sum [10] 11] 2log 2 n 1 3nlog 2 n 10n Gamma 6 n = 2 k Krapchenko [4] dlog 2 ne 7 p 2dlog 2 ne 16 3n 6 Delta 2 dlog 2 ne Ladner Fisher [5] 2dlog 2 ne 2k 2 (8 6 Delta 2 Gammak )n 0 k dlog 2 ne School Method [12] 2n Gamma 1 5n Gamma 3 Figure 1: Depths and sizes of several adders As L(f) C(f) one can derive for non degenerated Boolean ....
Krapchenko, Asymptotic estimation of addition time of parallel adder, Syst.Th.Res. 19, pp. 105-122
Upper Bounds on the Computational Power of an Optical Model of.. - Woods (2005) (Correct)
No context found.
V. Krapchenko. Asymptotic estimation of addition time of a parallel adder. Syst. Theory Res., 19:105--222, 1970.
Computational Complexity of an Optical Model of Computation - Woods (2005) (Correct)
No context found.
V.M. Krapchenko. Asymptotic estimation of addition time of a parallel adder. Syst. Theory Res., 19:105--222, 1970.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC