The prefix problem is to compute all the products x t o x2 . . . . o xk for i ~ k .~ n, where o is an associative operation A recurstve construction IS used to obtain a product circuit for solving the prefix problem which has depth exactly [log:n] and size bounded by 4n An application yields fast, small Boolean ctrcmts to simulate fimte-state transducers. By simulating a sequentml adder, a Boolean clrcmt which has depth 2[Iog2n] + 2 and size bounded by 14n Is obtained for n-bit binary addmon The size can be decreased significantly by permitting the depth to increase by an addmve constant
[1]
Yuri Petrovich Ofman,et al.
On the Algorithmic Complexity of Discrete Functions
,
1962
.
[2]
Taylor L. Booth,et al.
Sequential machines and automata theory
,
1967
.
[3]
D. C. Cooper,et al.
Sequential Machines and Automata Theory
,
1968,
Comput. J..
[4]
Donald Ervin Knuth,et al.
The Art of Computer Programming
,
1968
.
[5]
Arnold Schönhage.
A Lower Bound for the Length of Addition Chains
,
1975,
Theor. Comput. Sci..
[6]
M. Paterson.
An Introduction to Boolean Function Complexity.
,
1976
.