Skip to main content

Energy complexity of optical computations

Publication ,  Journal Article
Tyagi, A; Reif, JH
Published in: International Journal of Unconventional Computing
January 1, 2016

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.

Duke Scholars

Published In

International Journal of Unconventional Computing

EISSN

1548-7202

ISSN

1548-7199

Publication Date

January 1, 2016

Volume

12

Issue

5-6

Start / End Page

393 / 412

Related Subject Headings

  • Fluids & Plasmas
 

Citation

APA
Chicago
ICMJE
MLA
NLM
Tyagi, A., & Reif, J. H. (2016). Energy complexity of optical computations. International Journal of Unconventional Computing, 12(5–6), 393–412.
Tyagi, A., and J. H. Reif. “Energy complexity of optical computations.” International Journal of Unconventional Computing 12, no. 5–6 (January 1, 2016): 393–412.
Tyagi A, Reif JH. Energy complexity of optical computations. International Journal of Unconventional Computing. 2016 Jan 1;12(5–6):393–412.
Tyagi, A., and J. H. Reif. “Energy complexity of optical computations.” International Journal of Unconventional Computing, vol. 12, no. 5–6, Jan. 2016, pp. 393–412.
Tyagi A, Reif JH. Energy complexity of optical computations. International Journal of Unconventional Computing. 2016 Jan 1;12(5–6):393–412.

Published In

International Journal of Unconventional Computing

EISSN

1548-7202

ISSN

1548-7199

Publication Date

January 1, 2016

Volume

12

Issue

5-6

Start / End Page

393 / 412

Related Subject Headings

  • Fluids & Plasmas