Abstract

We propose a digital optical arithmetic processor design based on symbolic substitution using holographic matched and space-invariant filters. The proposed system performs Boolean logic, binary addition, and subtraction in a highly parallel manner; i.e., the processing time depends on word size but not array size. Algorithms for performing binary addition and subtraction in parallel are presented. A skew problem occurring when symbolic substitution is applied to binary addition and subtraction with space-invariant systems is addressed, and its solution is suggested. Crosstalk in symbolic substitution is described, and new symbols which can prevent the crosstalk are introduced. System analysis and fundamental limitations of the proposed system are also presented in terms of processing time, overall light efficiency, and the maximum array size of the input data plane. The performance of the proposed system with that of the current electronic supercomputers has been compared by combining information about the processing time and maximum array size.

© 1990 Optical Society of America

Highly parallel arithmetic algorithms for a digital optical processor using symbolic substitution logic

Karl-Heinz Brenner, Maria Kufner, and Stefan Kufner
Appl. Opt. 29(11) 1610-1618 (1990)

Optical symbolic substitution using diffraction gratings

Ruedi Thalmann, Giancarlo Pedrini, and Kenneth J. Weible
Appl. Opt. 29(14) 2126-2134 (1990)

Digital optical computing with symbolic substitution

Karl-Heinz Brenner, Alan Huang, and Norbert Streibl
Appl. Opt. 25(18) 3054-3060 (1986)

Optical higher-order symbolic recognition

George Eichmann, Andrew Kostrzewski, Dai Hyun Kim, and Yao Li
Appl. Opt. 29(14) 2135-2147 (1990)

Symbolic substitution modified signed-digit optical adder

David Casasent and Paul Woodford
Appl. Opt. 33(8) 1498-1506 (1994)