Simple and efficient CMOS circuit for fast VLSI adder realization
- 6 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On implementing addition in VLSI technologyJournal of Parallel and Distributed Computing, 1988
- Fast area-efficient VLSI addersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1987
- A Heuristic for Suffix SolutionsIEEE Transactions on Computers, 1986
- Regular, area-time efficient carry-lookahead addersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- A 32-bit execution unit in an advanced NMOS technologyIEEE Journal of Solid-State Circuits, 1982
- A Regular Layout for Parallel AddersIEEE Transactions on Computers, 1982
- Automatic Generation of Cells for Recurrence StructuresPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence EquationsIEEE Transactions on Computers, 1973
- Skip Techniques for High-Speed Carry-Propagation in Binary Arithmetic UnitsIEEE Transactions on Electronic Computers, 1961
- Parallel addition in digital computers: a new fast ‘carry’ circuitProceedings of the IEE - Part B: Electronic and Communication Engineering, 1959