Share Email Print

Proceedings Paper

Parallel Algormiivls For Optical Digital Computers
Author(s): Alan Huang
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Conventional computers suffer from several communication bottlenecks which fundamentally limit their performance. These bottlenecks are characterized by an address-dependent sequential transfer of information which arises from the need to time-multiplex information over a limited number of interconnections. An optical digital computer based on a classical finite state machine can be shown to be free of these bottlenecks. Such a processor would be unique since it would be capable of modifying its entire state space each cycle while conventional computers can only alter a few bits. New algorithms are needed to manage and use this capability. A technique based on recognizing a particular symbol in parallel and replacing it in parallel with another symbol is suggested. Examples using this parallel symbolic substitution to perform binary addition and binary incrementation are presented. Applications involving Boolean logic, functional programming languages, production rule driven artificial intelligence, and molecular chemistry are also discussed.

Paper Details

Date Published: 15 April 1983
PDF: 5 pages
Proc. SPIE 0422, 10th Intl Optical Computing Conf, (15 April 1983); doi: 10.1117/12.936118
Show Author Affiliations
Alan Huang, Bell Laboratories (United States)

Published in SPIE Proceedings Vol. 0422:
10th Intl Optical Computing Conf
Sam Horvitz, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?