Enhancing parallel-prefix structures using carry-save notation
Authors:
- 1 August 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 354-357
Abstract
Parallel prefix adders draw much attention because of their logarithmic delay. This paper proposes a scheme to enhance parallel prefix adders by incorporating the idea of carry-save addition within the prefix tree. Results are given for several designs using a publicly available nanometer library.Keywords
This publication has 9 references indexed in Scilit:
- Robust Energy-Efficient Adder Topologies18th IEEE Symposium on Computer Arithmetic (ARITH '07), 2007
- A taxonomy of parallel prefix networks2004
- A family of adders2002
- Fast area-efficient VLSI adders1987
- A Regular Layout for Parallel AddersIEEE Transactions on Computers, 1982
- High-Speed Binary AdderIBM Journal of Research and Development, 1981
- Parallel Prefix ComputationJournal of the ACM, 1980
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence EquationsIEEE Transactions on Computers, 1973
- Conditional-Sum Addition LogicIEEE Transactions on Electronic Computers, 1960