Share Email Print

Proceedings Paper

Consuming computational complexity by space-time fanout in optical computing
Author(s): H. John Caulfield
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Computational complexity is the minimum price in terms of resources required to obtain the result using a given algorithm for a problem of a given size. Electronic computers can pay the price in terms of time or space - through concurrency methods such as parallel or pipelined processors. Optical computers allow the use of a third resource - fanin. By using space and fanin, optical processors can perform some tasks at a speed independent of the size of the input. Examples from conventional algorithmic processes and somewhat less familiar nonalgorithmic processes are provided as illustration.

Paper Details

Date Published: 13 November 2001
PDF: 7 pages
Proc. SPIE 4471, Algorithms and Systems for Optical Information Processing V, (13 November 2001); doi: 10.1117/12.449337
Show Author Affiliations
H. John Caulfield, Fisk Univ. (United States)

Published in SPIE Proceedings Vol. 4471:
Algorithms and Systems for Optical Information Processing V
Bahram Javidi; Demetri Psaltis, Editor(s)

© SPIE. Terms of Use
Back to Top