Parallel Prefix Computation (1980)
| Venue: | Journal of the ACM |
| Citations: | 259 - 1 self |
BibTeX
@ARTICLE{Ladner80parallelprefix,
author = {Richard E. Ladner and Michael and J. Fischer},
title = {Parallel Prefix Computation},
journal = {Journal of the ACM},
year = {1980},
volume = {27},
pages = {831--838}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
ABSTRACT 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
Citations
| 1813 | The Art of Computer Programming - Knuth - 1968 |
| 3 | An introduction to Boolean function complexity, Societe Math. de France Asterisque - Paterson - 1976 |
| 1 | Sequential Machines and Automata Theory - BOOTtl - 1967 |
| 1 | On the addiUon ofbmary numbers - BRENT - 1970 |
| 1 | The Complexity of Computing. Wdey - SAVAGE - 1976 |
