Abstract

Computational origami is an algorithm by which one can reshape another algorithm. This reshaping permits various time–hardware trade-offs to be explored. An algorithm, is first rearranged as feed forward with constant fan-in and fan-out. It is then regularized into certain predetermined geometries that break the lateral data dependencies. The result is then folded with the help of delay lines. This time–hardware trade-off technique is also applicable to the scheduling of multiple-instruction multiple-data parallel processors and bit serial VLSI designs.

© 1992 Optical Society of America

Reset-free system for real-time polarization control and synthesis

Andreas Weber, Brian L Heffner, David W. Dolfi, and Patrick Chou
Appl. Opt. 31(34) 7180-7182 (1992)

Bit-serial architecture for optical computing

Vincent P. Heuring, Harry F. Jordan, and Jonathan P. Pratt
Appl. Opt. 31(17) 3213-3224 (1992)

Optical perfect-shuffle-exchange interconnection network using a liquid-crystal spatial light switch

Mingcui Cao, Fengguang Luo, Hongpu Li, and Shouhu Wang
Appl. Opt. 31(32) 6817-6819 (1992)

Multichannel acousto-optic crossbar switch with arbitrary signal fan-out

Dan Owen Harris and A. VanderLugt
Appl. Opt. 31(11) 1684-1686 (1992)

Self-aligning optical measurement systems

Arthur J. Decker
Appl. Opt. 31(22) 4339-4340 (1992)