Residue Number System Truth-Table Look-Up Processing-Moduli Selection and Logical Minimization
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 modu...
Uložené v:
| Vydané v: | IEEE transactions on computers Ročník C-33; číslo 10; s. 927 - 931 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
New York, NY
IEEE
01.10.1984
Institute of Electrical and Electronics Engineers |
| Predmet: | |
| ISSN: | 0018-9340 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | 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. |
|---|---|
| ISSN: | 0018-9340 |
| DOI: | 10.1109/TC.1984.1676355 |