Parallel Prefix Computation

@article{Ladner1980ParallelPC,
  title={Parallel Prefix Computation},
  author={R. Ladner and M. Fischer},
  journal={Journal of the ACM (JACM)},
  year={1980},
  volume={27},
  pages={831 - 838}
}
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… Expand
955 Citations

Figures and Topics from this paper

Efficient Algorithms for the Summed Area Tables Primitive on GPUs
  • 2
  • Highly Influenced
Novel High-Performance High-Valency Ling Adders
  • Highly Influenced
  • PDF
Algorithmes parallèles auto-adaptatifs et applications
  • 2
  • Highly Influenced
  • PDF
An efficient graph accelerator with parallel data conflict management
  • 20
  • Highly Influenced
  • PDF
A new recursive shared segmented split multiply-accumulate unit for high speed digital signal processing applications
  • Highly Influenced
Implementation of High Speed FIR Filter: Performance Comparison with Different Parallel Prefix Adders in FPGAs
  • Highly Influenced
  • PDF
Area-time efficient multi-modulus adders and their applications
  • 7
  • Highly Influenced
Design Methodology of Adaptable Hybrid Adders
  • Highly Influenced
  • PDF
Appendix A : A functional programming approach to hardware acceleration of algorithms
  • Highly Influenced
  • PDF
Minimal parallel prefix circuits
  • 1
  • Highly Influenced
...
1
2
3
4
5
...