13 November 2001 Consuming computational complexity by space-time fanout in optical computing
Author Affiliations +
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.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
H. John Caulfield, H. John Caulfield, } "Consuming computational complexity by space-time fanout in optical computing", Proc. SPIE 4471, Algorithms and Systems for Optical Information Processing V, (13 November 2001); doi: 10.1117/12.449337; https://doi.org/10.1117/12.449337
PROCEEDINGS
7 PAGES


SHARE
RELATED CONTENT

Dynamic range control for analog or hybrid optical algebra
Proceedings of SPIE (August 24 1992)
Digital Optical Computing: Possibilities And Pitfalls
Proceedings of SPIE (January 04 1986)
Reprogrammable digital optical coprocessor
Proceedings of SPIE (August 24 1992)
Optical Algebraic Processing Architectures And Algorithms
Proceedings of SPIE (November 27 1984)
The Control Operator Method (COM)
Proceedings of SPIE (September 24 1986)
Hybrid Optoelectronic Nonlinear Algebra Processor
Proceedings of SPIE (August 22 1988)
Accurate Numerical Computation By Optical Convolution
Proceedings of SPIE (August 22 1980)

Back to Top