1994
DOI: 10.1364/ao.33.006146
|View full text |Cite
|
Sign up to set email alerts
|

Modified signed-digit arithmetic based on redundant bit representation

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-bitrepresentation 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0
1

Year Published

1995
1995
2013
2013

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 35 publications
(14 citation statements)
references
References 23 publications
0
13
0
1
Order By: Relevance
“…Further, note that our proposed TSD and QSD adder/subtracter can also be implemented using matrix-multiplication-based techniques. 18,20,22,24 …”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Further, note that our proposed TSD and QSD adder/subtracter can also be implemented using matrix-multiplication-based techniques. 18,20,22,24 …”
Section: Discussionmentioning
confidence: 99%
“…Using nonconventional number representations 2 ͑nonbinary͒ to design fast arithmetic units has gained much attention in recent years. Several nonbinary number representation schemes such as multiplevalued fixed radix-number, 3,4 residue number, 5-8 redundant number, 9 and signed-digit [9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25] were reported in the past decade to implement efficient arithmetic operations.…”
Section: Introductionmentioning
confidence: 99%
“…Based on BP encoding of MSD digits, the computation rules shown in Table I can be implemented by (using the case D3 of Table 2), gl =A1*B0+AO*B1, (2) g~=A1*B1+AO*BO,' (4) g4=A1*B0+AO*B1, (5) g6=gl +g4=(A1+A1)*B0+AO*(B1+B1), (7) g7=gb+g2+g~+g5=(A1+A1)*(B1+B1)+AO*BO, (8) g8=gb+gl+g2=A1+AO*B1, (9) gg=g~+g4+g5=A1+AO*B1+AO*BO, (10) C1=g7*(go'+gl'*g8")+g6*(g3'+g4'*g8")' (11) C1=g7*(g5'+g4'*g9")+g6*(g2'+gl'*g9")' (12) C0=g6*(go'+gl '*g8")+g7*(g3'+g4*g8") +g6*(g5'+g4'*g ")+g (g +g g ") (13) where "+" and "*" denote pixel wise addition and multiplication, gi (i=0, . .…”
Section: Modified Signed-digit Addition Algorithmmentioning
confidence: 99%
“…A number of different ways [4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22] of eliminating or advancing carries have been proposed. Nonbinary encoding such as the residue number system 5,6 and the modified signed-digit ͑MSD͒ number system [7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22] are of significant interest since they can eliminate or limit the carry propagation.…”
Section: Introductionmentioning
confidence: 99%