A Regular Layout for Parallel Adders
Brent, Kung · IEEE Transactions on Computers · 1982
With VLSI architecture, the chip area and design regularity represent a better measure of cost than the conventional gate count. We show that addition of n-bit binary numbers can be performed on a chip with a regular layout in time proportional to log n and with area proportional to n.
Cited by 1,147 works. doi:10.1109/tc.1982.1675982
Authors
References
- Introduction to V.L.S.I. Systems
- Parallel Prefix Computation
- Computer arithmetic: Principles, architecture, and design
- The Structure of Computers and Computations
- Area-time complexity for VLSI
- The complexity of computing
- The Area-Time Complexity of Binary Multiplication
- On the Time Required to Perform Addition
- Area-Efficient VLSI Computation
- The chip complexity of binary arithmetic