Energy Complexity of Optical Computations
Akhilesh Tyagi and John H. Reif
This paper provides lower bounds on the energy consumption and demonstrates an energy-time trade-off in optical computations. All the lower bounds are shown to have the matching upper bounds for a transitive function – shifting. Since the energy consumption in an optical transmission is a non-linear function of the distance, a new set of techniques was required to derive these lower bounds. We also characterize the energy requirements of 3-D VLSI computations.
Keywords: Lower bounds, trade-offs, energy, optical, electro-optical, VLSI, computation.