Paper
1 July 1990 Complexity of networks realized by fiber optic logic elements
Tsutomu Sasao
Author Affiliations +
Proceedings Volume 1215, Digital Optical Computing II; (1990) https://doi.org/10.1117/12.18044
Event: OE/LASE '90, 1990, Los Angeles, CA, United States
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.
© (1990) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Tsutomu Sasao "Complexity of networks realized by fiber optic logic elements", Proc. SPIE 1215, Digital Optical Computing II, (1 July 1990); https://doi.org/10.1117/12.18044
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Logic devices

Logic

Fiber optics

Fiber optic networks

Electronics

Optical computing

Network architectures

Back to Top