z-logo
open-access-imgOpen Access
Demonstration of optical computing logics based on binary decision diagram
Author(s) -
Shiwei Lin,
Yasuhiko Ishikawa,
Kazumi Wada
Publication year - 2012
Publication title -
optics express
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.394
H-Index - 271
ISSN - 1094-4087
DOI - 10.1364/oe.20.001378
Subject(s) - computer science , optical computing , optical transistor , optical switch , electronic circuit , adder , optics , node (physics) , transmission (telecommunications) , cmos , electronic engineering , transistor , physics , telecommunications , engineering , quantum mechanics , voltage
Optical circuits are low power consumption and fast speed alternatives for the current information processing based on transistor circuits. However, because of no transistor function available in optics, the architecture for optical computing should be chosen that optics prefers. One of which is Binary Decision Diagram (BDD), where signal is processed by sending an optical signal from the root through a serial of switching nodes to the leaf (terminal). Speed of optical computing is limited by either transmission time of optical signals from the root to the leaf or switching time of a node. We have designed and experimentally demonstrated 1-bit and 2-bit adders based on the BDD architecture. The switching nodes are silicon ring resonators with a modulation depth of 10 dB and the states are changed by the plasma dispersion effect. The quality, Q of the rings designed is 1500, which allows fast transmission of signal, e.g., 1.3 ps calculated by a photon escaping time. A total processing time is thus analyzed to be ~9 ps for a 2-bit adder and would scales linearly with the number of bit. It is two orders of magnitude faster than the conventional CMOS circuitry, ~ns scale of delay. The presented results show the potential of fast speed optical computing circuits.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here