Abstract

Optical computing has been suggested as a means of achieving a high degree of parallelism for both scientific and symbolic applications. While a number of implementations of logic operations have been forwarded, all have some characteristic that prevents their direct extension to functions of a large number of input bits. We analyze several of these implementations and demonstrate that all these implementations require that some measure of the system (area, space–bandwidth product, or time) grow exponentially with the number of inputs. We then suggest an implementation whose complexity is no greater than the best theoretical realization of a Boolean function. We demonstrate the optimality of that realization, to within a constant multiple, for digital optical-computing systems realized by bulk spatially variant elements.

© 1992 Optical Society of America

Integrable surface-emitting laser-based optical switches and logic gates for parallel digital optical computing

Julian Cheng and Ping Zhou
Appl. Opt. 31(26) 5592-5603 (1992)

Optical computing and the Fredkin gates

Joseph Shamir, H. John Caulfield, William Micelli, and Robert J. Seymour
Appl. Opt. 25(10) 1604-1607 (1986)

Bit-serial architecture for optical computing

Vincent P. Heuring, Harry F. Jordan, and Jonathan P. Pratt
Appl. Opt. 31(17) 3213-3224 (1992)

Digital optical computing with symbolic substitution

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

Polarization-encoded optical shadow-casting arithmetic-logic-unit design: separate and simultaneous output generation

Jamal U. Ahmed and Abdul Ahad S. Awwal
Appl. Opt. 31(26) 5622-5631 (1992)