Consuming computational complexity by space-time fanout in optical computing

H. John Caulfield

doi:10.1117/12.449337

13 November 2001 Consuming computational complexity by space-time fanout in optical computing

H. John Caulfield

Proceedings Volume 4471, Algorithms and Systems for Optical Information Processing V; (2001) https://doi.org/10.1117/12.449337
Event: International Symposium on Optical Science and Technology, 2001, San Diego, CA, United States

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.

Citation Download Citation

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); https://doi.org/10.1117/12.449337

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available