OSA's Digital Library

Applied Optics

Applied Optics


  • Vol. 27, Iss. 9 — May. 1, 1988
  • pp: 1651–1660

Optical design of programmable logic arrays

Miles J. Murdocca, Alan Huang, Jurgen Jahns, and Norbert Streibl  »View Author Affiliations

Applied Optics, Vol. 27, Issue 9, pp. 1651-1660 (1988)

View Full Text Article

Enhanced HTML    Acrobat PDF (1294 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools



Regular free-space interconnects such as the perfect shuffle and banyan provided by beam splitters, lenses, and mirrors connect optical logic gates arranged in 2-D arrays. An algorithmic design technique transforms arbitrary logic equations into a near-optimal depth circuit. Analysis shows that an arbitrary interconnect makes little or no improvement in circuit depth and can even reduce throughput. Gate count is normally higher with a regular interconnect, and we show cost bounds. We conclude that regularly interconnected circuits will have a higher gate count compared with arbitrarily interconnected circuits using the design techniques presented here and that regular free-space interconnects are comparable with arbitrary interconnects in terms of circuit depth and are preferred to arbitrary interconnects for maximizing throughput.

© 1988 Optical Society of America

Original Manuscript: July 14, 1987
Published: May 1, 1988

Miles J. Murdocca, Alan Huang, Jurgen Jahns, and Norbert Streibl, "Optical design of programmable logic arrays," Appl. Opt. 27, 1651-1660 (1988)

Sort:  Author  |  Year  |  Journal  |  Reset  


  1. J. von Neumann, “Nonlinear Capacitance or Inductance Switching, Amplifying and Memory Devices,” in John von Neumann’s Collected Works, Vol. 5 (Macmillan, New York, 1963).
  2. H. M. Gibbs, Optical Bistability, Controlling Light with Light, (Academic, New York, 1985).
  3. A recent collection of papers is Technical Digest, Topical Meeting on Optical Bistability (OB3) (Optical Society of America, Washington, DC, 1985).
  4. J. L. Jewell, Y. H. Lee, M. Warren, H. M. Gibbs, N. Peyghambarian, A. C. Gossard, W. Wiegmann, “3-pJ 82-MHz Optical Logic Gates in a Room Temperature GaAs-AlGaAs Multiple Quantum Well Etalon,” Appl. Phys. Lett. 46, 918 (1985). [CrossRef]
  5. L. C. West, “Spectroscopy of GaAs Quantum Wells,” Ph.D. Thesis, Stanford U. (1985). [CrossRef]
  6. D. A. B. Miller, D. S. Chemla, T. C. Damen, T. H. Wood, C. A. Burrus, A. C. Gossard, W. Wiegmann, “The Quantum Well Self-Electrooptic Effect Device: Optoelectronic Bistability and Oscillation and Self-Linearized Modulation,” IEEE J. Quantum Electron. QE-21, 1462 (1985). [CrossRef]
  7. A. Huang, “Parallel Algorithms for Optical Digital Computers,” at IEEE 1983 Tenth International Optical Computing Conference, (1983), p. 13. [CrossRef]
  8. M. J. Murdocca, “Techniques for Parallel Numeric and Non-Numeric Algorithm Design in Digital Optics,” Master's Thesis, Rutgers U. (1985).
  9. K.-H. Brenner, A. Huang, N. Streibl, “Digital Optical Computing with Symbolic Substitution,” Appl. Opt. 25, 3054 (1986). [CrossRef] [PubMed]
  10. M. J. Murdocca, “Digital Optical Computing with One-Rule Cellular Automata,” Appl. Opt. 26, 3365 (1987). [CrossRef]
  11. M. J. Murdocca, N. Streibl, “A Digital Design Technique for Optical Computing,” in Technical Digest, Topical Meeting on Optical Computing, Tech. Digest Ser. 1987, Vol. 11 (Optical Society of America, Washington, DC, 1987) pp. 9–11.
  12. K.-H. Brenner, A. Huang, “Optical Implementations of the Perfect Shuffle Interconnections,” Appl. Opt. 27, 135 (1988). [CrossRef] [PubMed]
  13. A. W. Lohmann, “Optical Perfect Shuffle,” Appl. Opt. 25, 1530 (1986). [CrossRef] [PubMed]
  14. H. S. Stone, “Parallel Processing with the Perfect Shuffle,” IEEE Trans. Comput. C-20, 153 (1971). [CrossRef]
  15. D. H. Lawrie, “Access and Alignment of Data in an Array Processor,” IEEE Trans. Comput. C-24, 1145 (1975). [CrossRef]
  16. C.-L. Wu, T.-Y. Feng, “The Universality of the Shuffle-Exchange Network,” IEEE Trans. Comput. C-30, 324 (1981). [CrossRef]
  17. D. Knuth, The Art of Computer Programming (Addison-Wesley, Reading, MA, 1973), Vol. 3, p. 237.
  18. J. W. Cooley, J. W. Tukey, “An Algorithm for the Machine Calculation of Complex Fourier Series,” Math. Comput. 19, 297 (1965). [CrossRef]
  19. M. Minsky, Computation: Finite and Infinite Machines (Prentice Hall, Englewood Cliffs, NJ, 1967), p. 117.
  20. See, for example, Z. Kohavi, Switching and Finite Automata Theory (McGraw-Hill, New York, 1978).

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

« Previous Article  |  Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited