Abstract

An optical system called the optical expander is described and investigated. The optical expander electro-optically expands an optical Boolean pattern encoded in d bits into an optical pattern of size N bits. It is assumed that d is equal to c log₂ N for some constant c, and each expanded pattern is orthogonal to the others. Two different architectures to implement the optical expander are described: one uses an optical matrix–vector multiplier and an array of N threshold devices; the other uses log₂ N novel reflection–transmission switching cells. These architectures are analyzed in terms of size, energy requirement, and speed. The optical expander described utilizes high-speed and high-space–bandwidth-product connections that are provided by optical beams in three dimensions. Potential applications, holographic memory, and message routing systems are also discussed.

© 1993 Optical Society of America

Parallel algorithms based on expander graphs for optical computing

Ramamohan Paturi, Dau-Tsuong Lu, Joseph E. Ford, Sadik C. Esener, and Sing H. Lee
Appl. Opt. 30(8) 917-927 (1991)

Lower bounds on the computational efficiency of optical computing systems

Richard Barakat and John Reif
Appl. Opt. 26(6) 1015-1018 (1987)

Butterfly interconnection networks and their applications in information processing and optical computing: applications in fast-Fourier-transform-based optical information processing

De-Gui Sun, Na-Xin Wang, Li-Ming He, Zhen-Wu Lu, and Zhao-Heng Weng
Appl. Opt. 32(35) 7184-7193 (1993)

Modified gamma network and its optical implementation

Yaming Wu, Liren Liu, and Zhijiang Wang
Appl. Opt. 32(35) 7194-7199 (1993)

Design of optical circuits for multiplex computing based on set-valued logic

Takafumi Aoki, Shuichi Maeda, and Tatsuo Higuchi
Appl. Opt. 32(35) 7170-7183 (1993)