Design of residue generators and multioperand modular adders using carry-save adders
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 43 (1) , 68-77
- https://doi.org/10.1109/12.250610
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Design and performance of the IBM Enterprise System/9000 Type 9121 Vector FacilityIBM Journal of Research and Development, 1991
- Self-testing checkers for arithmetic codes with any check base APublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- A neural-like network approach to finite ring computationsIEEE Transactions on Circuits and Systems, 1990
- Short note: VLSI Binary-Residue Converters for Pipelined ProcessingThe Computer Journal, 1990
- Design of multioperand carry-save adders for arithmetic modulo (2 n +1)Electronics Letters, 1989
- Rrecursive reduction in finite ring computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Efficient VLSI networks for converting an integer from binary system to residue number system and vice versaIEEE Transactions on Circuits and Systems, 1988
- High-speed signal processing using systolic arrays over finite ringsIEEE Journal on Selected Areas in Communications, 1988
- Residue arithmetic for a fault-tolerant multiplier: The choice of the best triple of basesMicroprocessing and Microprogramming, 1987
- The use of residue number systems in the design of finite impulse response digital filtersIEEE Transactions on Circuits and Systems, 1977