Complexity analysis of optical-computing paradigms

Ahmed Louri, Arthur Post

Research output: Contribution to journalArticle

7 Scopus citations

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 implementa¬tions 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.

Original languageEnglish (US)
Pages (from-to)5568-5583
Number of pages16
JournalApplied optics
Volume31
Issue number26
DOIs
StatePublished - Sep 1992

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics
  • Engineering (miscellaneous)
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Complexity analysis of optical-computing paradigms'. Together they form a unique fingerprint.

  • Cite this