Name
Abstract | ||
|---|---|---|
The delay characteristics of carry-lookahead (CLA) adders are examined with respect to a delay model that accounts for fan-in and fan-out dependencies. Though CLA structures are considered among the fastest topologies for performing addition, they have also been characterized as providing marginal speed improvement for the amount of hardware invested. This analysis shows that this inefficiency can be explained by the suboptimal nature of common CLA implementations. Simulation results show that the CLA structures in wide use can be improved by varying the block sizes and the number of levels within each adder. Examples of optimal CLA structures are given and heuristic methods for finding these structures are presented. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1007/BF00936899 | VLSI Signal Processing |
Keywords | Field | DocType |
Critical Path,Delay Path,Delay Model,Computer Arithmetic,NAND Gate | Heuristic,Adder,Computer science,Algorithm,Real-time computing,Network topology,NAND gate,Critical path method | Journal |
Volume | Issue | Citations |
3 | 4 | 6 |
PageRank | References | Authors |
2.00 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Brian D. Lee | 1 | 6 | 2.34 |
| Vojin G. Oklobdzija | 2 | 806 | 137.25 |