Residue Number System Truth-Table Look-Up Processing—Moduli Selection and Logical Minimization
- 1 October 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-33 (10), 927-931
- https://doi.org/10.1109/tc.1984.1676355
Abstract
Truth table look-up processing using binary coded residue numbers is investigated for full-precision addition and multiplication for implementations using either electronic or optical technologies. The logically minimized numbers of input combinations needed for each operation are presented for moduli 2-23. The moduli sets that require the minimum number of reference patterns are determined for addition and multiplication of 4, 8, 12, and 16 bit words.Keywords
This publication has 13 references indexed in Scilit:
- Special properties of complement codes for redundant residue number systemsProceedings of the IEEE, 1981
- Are VLSI Microcircuits Too Hard to Design?Science, 1980
- Multiple storage and erasure of fixed holograms in Fe−doped LiNbO3Applied Physics Letters, 1975
- Synthetic Aperture Processing with Limited Storage and PresummingIEEE Transactions on Aerospace and Electronic Systems, 1973
- General Division in the Symmetric Residue Number SystemIEEE Transactions on Computers, 1973
- Error Correction in Residue ArithmeticIEEE Transactions on Computers, 1972
- The Basis for Implementation of Ad idive Operations in the Residue Number SystemIEEE Transactions on Computers, 1968
- Addition and Subtraction in the Residue Number SystemIEEE Transactions on Electronic Computers, 1967
- Synthetic Aperture RadarIEEE Transactions on Aerospace and Electronic Systems, 1967
- The Residue Number SystemIEEE Transactions on Electronic Computers, 1959