1997
DOI: 10.1016/s0030-3992(96)00066-7
|View full text |Cite
|
Sign up to set email alerts
|

Unified negabinary symbolic arithmetic for addition and subtraction with polarization-encoded optical shadow casting

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

1998
1998
2014
2014

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 20 publications
0
4
0
Order By: Relevance
“…In optical shadow casting, the light emitted by an array of light emitting diodes passes through a few input planes and then forms an overlapped pattern on the output plane [2]. Optical shadow casting was used to implement addition [4,10], and was augmented to use the modified signed-digit number system [59] to perform addition more efficiently [7,15,16].…”
Section: Related Wordmentioning
confidence: 99%
See 2 more Smart Citations
“…In optical shadow casting, the light emitted by an array of light emitting diodes passes through a few input planes and then forms an overlapped pattern on the output plane [2]. Optical shadow casting was used to implement addition [4,10], and was augmented to use the modified signed-digit number system [59] to perform addition more efficiently [7,15,16].…”
Section: Related Wordmentioning
confidence: 99%
“…Diversity of supported operations: Almost all of the past optical processors implement a single arithmetic operations like addition [14,15,23,35,36,53,63], multiplication [70], or vector-matrix multiplication [29,38,39]. In this paper we implement different arithmetic operations, making it possible to perform various multi-step computational tasks.…”
Section: Comparisonmentioning
confidence: 99%
See 1 more Smart Citation
“…output "1": h +(a1 b)g,f , (2) for t, outputl": (ab1 +(a b)fg , (3) output"l': (a 'b. )f , (4) forw1, output"l": (ab)f. (5) In the second step, the involved logic operations for the final sum s are the same as for w in the first step by defining a binary reference bit g which is true for nonnegative t and w.…”
mentioning
confidence: 99%