Share Email Print
cover

Proceedings Paper

Complexity of networks realized by fiber optic logic elements
Author(s): Tsutomu Sasao
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Complexity of combinational logic networks realized by fiber optic logic elements is analyzed. The fiber-optic elements consist of optical fibers, photo detectors, and light emitting diodes, and they act as NOR (or NAND) gates. We assume that both true and complemented variables are available as inputs, and that the networks are at most three levels. The measures of complexity include number of gates, fan-in, fan-out, connections, and array size when realized by programmable logic arrays. The complexity for arbitrary functions, symmetric functions, parity functions and adders are derived by using combinatorial mathematics, and for other arithmetic functions, randomly generated functions, control networeks for microprocessors are derived by computer simulation. These measures are useful for estimating the amount of hardware and power dissipation to realize various functions by fiber-optic logic networks.

Paper Details

Date Published: 1 July 1990
PDF: 12 pages
Proc. SPIE 1215, Digital Optical Computing II, (1 July 1990); doi: 10.1117/12.18044
Show Author Affiliations
Tsutomu Sasao, Kyushu Institute of Technology (Japan)


Published in SPIE Proceedings Vol. 1215:
Digital Optical Computing II
Raymond Arrathoon, Editor(s)

© SPIE. Terms of Use
Back to Top