AREA-Time Efficient Addition in Charge Based Technology
- 1 January 1981
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Using the model developed by Mead and Conway for charge based technology, a methodology for the production of area-time efficient adders which imbeds the buffering required to drive large loads caused by the carry-lookahead tree has been developed. This methodology can be used to produce an 0(logN) time and 0(NlogN) area layout. Additionally, an algorithm was written to produce minimal silicon area layouts for a given time bound. This algorithm involves optimization at both the cellular level and the layout level in an iterative fashion to allow the relevant technological parameters to play a role in the cellular design phase. Results of the algorithm including examples and an area-time curve for a 48 bit adder using typical 5 micron NMOS [MeCo80] are displayed.Keywords
This publication has 6 references indexed in Scilit:
- Parallel Prefix ComputationJournal of the ACM, 1980
- Delay-time optimization for driving and sensing of signals on high-capacitance paths of VLSI systemsIEEE Journal of Solid-State Circuits, 1979
- Cost and performance of VLSI computing structuresIEEE Transactions on Electron Devices, 1979
- Combinational Circuit Synthesis with Time and Component BoundsIEEE Transactions on Computers, 1977
- On the Addition of Binary NumbersIEEE Transactions on Computers, 1970
- On the Time Required to Perform AdditionJournal of the ACM, 1965