Abstract
Fully parallel modified signed-digit arithmetic operations are realized based on redundant bit representation of the digits proposed. A new truth-table minimizing technique is presented based on redundant-bit-representation coding. It is shown that only 34 minterms are enough for implementing one-step modified signed-digit addition and subtraction with this new representation. Two optical implementation schemes, correlation and matrix multiplication, are described. Experimental demonstrations of the correlation architecture are presented. Both architectures use fixed minterm masks for arbitrary-length operands, taking full advantage of the parallelism of the modified signed-digit number system and optics.
© 1994 Optical Society of America
Full Article | PDF ArticleMore Like This
Abdallah K. Cherri and Mohammed S. Alam
Appl. Opt. 37(20) 4405-4418 (1998)
De-Gui Sun, Li-MIng He, Na-Xin Wang, and Zhao-Heng Weng
Appl. Opt. 33(29) 6755-6761 (1994)
Berlin Ha and Yao Li
Appl. Opt. 33(17) 3647-3662 (1994)