Complexity analysis of optical-computing paradigms

Ahmed Louri, Arthur Post

Research output: Contribution to journalArticle

7 Citations (Scopus)

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 - 1992

Fingerprint

Optical data processing
Boolean functions
logic
products

ASJC Scopus subject areas

  • Atomic and Molecular Physics, and Optics

Cite this

Complexity analysis of optical-computing paradigms. / Louri, Ahmed; Post, Arthur.

In: Applied Optics, Vol. 31, No. 26, 1992, p. 5568-5583.

Research output: Contribution to journalArticle

Louri, Ahmed ; Post, Arthur. / Complexity analysis of optical-computing paradigms. In: Applied Optics. 1992 ; Vol. 31, No. 26. pp. 5568-5583.
@article{89815ec6bcf14d3cbc96db5d1e3f9a76,
title = "Complexity analysis of optical-computing paradigms",
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.",
author = "Ahmed Louri and Arthur Post",
year = "1992",
doi = "10.1364/AO.31.005568",
language = "English (US)",
volume = "31",
pages = "5568--5583",
journal = "Applied Optics",
issn = "1559-128X",
publisher = "The Optical Society",
number = "26",

}

TY - JOUR

T1 - Complexity analysis of optical-computing paradigms

AU - Louri, Ahmed

AU - Post, Arthur

PY - 1992

Y1 - 1992

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=18844374132&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=18844374132&partnerID=8YFLogxK

U2 - 10.1364/AO.31.005568

DO - 10.1364/AO.31.005568

M3 - Article

AN - SCOPUS:18844374132

VL - 31

SP - 5568

EP - 5583

JO - Applied Optics

JF - Applied Optics

SN - 1559-128X

IS - 26

ER -