A Regular Layout for Parallel Adders
Citations
984 citations
575 citations
Cites background from "A Regular Layout for Parallel Adder..."
...The three basic architectures are the ripple carry adder with a passgate-based Manchester carry chain (static and dynamic) [29], logarithmic carry-select (static, dynamic, and passgate) [17], and carry-lookahead (Kogge–Stone radix 2 and radix 4 [30], Han–Carlson [31], and Brent–Kung [ 32 ])....
[...]
[...]
571 citations
531 citations
423 citations
References
11,671 citations
2,993 citations
"A Regular Layout for Parallel Adder..." refers background in this paper
...Index Terms: Addition, area-time complexity, carry lookahead, circuit design, combinational logic, models of computation, parallel addition, parallel polynomial evaluation, prefix computation, VLSI....
[...]
1,159 citations
"A Regular Layout for Parallel Adder..." refers methods in this paper
...Although the same idea was used by Ladner and Fischer [8], their results are not directly applicable because they ignored fan-out restrictions and used the gate count rather than area as a complexity measure....
[...]
...Although the same idea was used by Ladner and Fischer [8], their results are not directly applicable because they ignored fan out restrictions and used the gate count rather than area as a complexity measure....
[...]
996 citations
Additional excerpts
...See, for example, [1], [4], [6], [7], [11], [13], and [14]....
[...]
488 citations
Additional excerpts
...See, for example, [1], [4], [6], [7], [11], [13], and [14]....
[...]