Skip to main content
SpringerLink
Log in

Space-time complexity in optical computing

  • Published:
Multidimensional Systems and Signal Processing Aims and scope Submit manuscript

Abstract

Given certain simple and well defined operations and complexity measures, the product of spatial complexity with temporal complexity must exceed a certain minimum problem complexity if that processor is to solve that problem. Some optical processors violate that condition in a favorable direction (anomalously small temporal complexity). We next extend the requirement to embrace those optical processors. In its final form, the theorem requires that the product of spatial, temporal, and fanin complexities equal or exceed the problem complexity.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • M.A.G. Abushagur, H.J. Caulfield, D.M. Gibson, and M. Habli, “Superconvergence of hybrid optoelectronic processors.”

  • M.A.G. Abushagur and H.J. Caulfield, “Speed and convergence of bimodal optical computers,”Opt. Eng. 26, pp. 22–27, 1987.

    Google Scholar 

  • R.L. Burden and J.D. Faires,Numerical Analysis, 4th Edition, PWS-Kent: Boston, pp. 370–372, 1989.

    Google Scholar 

  • H.J. Caulfield and J. Shamir, “Wave particle duality considerations in optical computing,”Appl. Opt., vol. 28, no. 12, pp. 2184–2186, 1989.

    Google Scholar 

  • H.J. Caulfield, “ParallelN 4 weighted optical interconnections,”Appl. Opt. 26, p. 4039, 1987.

    Google Scholar 

  • H.J. Caulfield, J.H. Gruninger, J.E. Ludman, K. Steiglits, H. Rabitz, J. Gelfand, and E. Tsoni, “Bimodal optical computers,”Appl. Opt. 25, pp. 3128–3131, 1986.

    Google Scholar 

  • J. Shamir, H.J. Caulfield and R.B. Johnson, “Massive holographic interconnection networks and their limitations,”Appl. Opt. 28, pp. 311–324, 1989.

    Google Scholar 

  • Jeffrey D. Ullman,Computational Aspects of VLSI, Computer Science Press: Rockville, Maryland, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Center for Applied Optics, University of Alabama in Huntsville, 35899, Huntsville, Alabama

    H. J. Caulfield

Authors
  1. H. J. Caulfield
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Some parts of this work were presented at the SPIE symposium “Optical Information Processing Systems and Architectures II,” in San Diego, California, July 1990.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Caulfield, H.J. Space-time complexity in optical computing. Multidim Syst Sign Process 2, 373–378 (1991). https://doi.org/10.1007/BF01937172

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01937172

Keywords

Search

Navigation