New algorithms for carry propagation
- 17 April 2005
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the 15th ACM Great Lakes symposium on VLSI - GLSVSLI '05
- p. 396-399
- https://doi.org/10.1145/1057661.1057755
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A 4-GHz 130-nm address generation unit with 32-bit sparse-tree adder coreIEEE Journal of Solid-State Circuits, 2003
- VLSI implementation of GSC architecture with a new ripple carry adderPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A sub-nanosecond 0.5 μm 64 b adder designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fast adders using enhanced multiple-output domino logicIEEE Journal of Solid-State Circuits, 1997
- A spanning tree carry lookahead adderIEEE Transactions on Computers, 1992
- Variants of an improved carry look-ahead adderIEEE Transactions on Computers, 1988
- High-Speed Binary AdderIBM Journal of Research and Development, 1981
- Skip Techniques for High-Speed Carry-Propagation in Binary Arithmetic UnitsIEEE Transactions on Electronic Computers, 1961