Introduction to algorithms
Computer arithmetic algorithms
Computer arithmetic algorithms
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
On the capabilities of systolic systems
Proceedings of the 3rd ACM symposium on Parallel algorithms and architectures
Journal of the ACM (JACM)
Graph Algorithms
Computer Architecture: Complexity and Correctness
Computer Architecture: Complexity and Correctness
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
ARITH '99 Proceedings of the 14th IEEE Symposium on Computer Arithmetic
A Regular Layout for Parallel Adders
IEEE Transactions on Computers
Optimizing synchronous systems
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
A declarative encoding of telecommunications feature subscription in SAT
PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
| Hi-index | 5.23 |
We present a self-contained and detailed description of the parallel-prefix adder of Ladner and Fischer. Very little background is assumed in digital hardware design. The goal is to understand the rational behind the design of this adder and view the parallel-prefix adder as an outcome of a general method.