Design of residue generators and multioperand modular adders using carry-save adders
- 9 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The design of residue generators and multioperand modular adders is studied. Novel highly parallel schemes using carry-save adders with end-around carry are proposed for either type of circuit. They are derived on the basis of the periodicity of the series of powers of two taken modulo A (A is a module). The novel circuits are faster and use less hardware than existing similar circuits Author(s) Piestrak, S.J. Inst. of Eng. Cybern., Tech. Univ. of Wroclaw, PolandKeywords
This publication has 10 references indexed in Scilit:
- Multi-operand modulo addition using carry save addersElectronics Letters, 1990
- Design of high-speed and cost-effective self-testing checkers for low-cost arithmetic codesIEEE Transactions on Computers, 1990
- Design of multioperand carry-save adders for arithmetic modulo (2 n +1)Electronics Letters, 1989
- Efficient VLSI networks for converting an integer from binary system to residue number system and vice versaIEEE Transactions on Circuits and Systems, 1988
- Efficient design of totally self-checking checkers for all low-cost arithmetic codesIEEE Transactions on Computers, 1988
- Residue arithmetic for a fault-tolerant multiplier: The choice of the best triple of basesMicroprocessing and Microprogramming, 1987
- Associative table lookup processing for multioperand residue arithmeticJournal of the ACM, 1987
- Residue Arithmetic A Tutorial with ExamplesComputer, 1984
- The use of residue number systems in the design of finite impulse response digital filtersIEEE Transactions on Circuits and Systems, 1977
- Arithmetic Error Codes: Cost and Effectiveness Studies for Application in Digital System DesignIEEE Transactions on Computers, 1971