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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on computers Ročník C-33; číslo 10; s. 927 - 931
Hlavní autoři:	GUEST, C. C, MIRSALEHI, M. M, GAYLORD, T. K
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.10.1984 Institute of Electrical and Electronics Engineers
Témata:	Applied sciences Content-addressable memory Electronics Exact sciences and technology logical minimization logical reduction optical processing programmable array logic residue number system Storage and reproduction of information truth-table look-up processing Optical information processing Minimization Reduction Memory Programmable logic array
ISSN:	0018-9340
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
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