Cascadable all-optical NAND gates using diffractive networks
Yi Luo, Deniz Mengu, Aydogan Ozcan
Scientific Reports · 2022
doi:10.1038/s41598-022-11331-4 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Owing to its potential advantages such as scalability, low latency and power efficiency, optical computing has seen rapid advances over the last decades. Here, we present the design and analysis of cascadable all-optical NAND gates using diffractive neural networks. We encoded the logical values at the input and output planes of a diffractive NAND gate using the relative optical power of two spatially-separated apertures. Based on this architecture, we numerically optimized the design of a diffractive neural network composed of 4 passive layers to all-optically perform NAND operation using diffraction of light, and cascaded these diffractive NAND gates to perform complex logical functions by successively feeding the output of one diffractive NAND gate into another. We numerically demonstrated the cascadability of our diffractive NAND gates by using identical diffractive designs to all-optically perform AND and OR operations, which can be formulated as $$\mathrm{AND}\left({I}_{1}, {I}_{2}\right)=\mathrm{NAND}\left(\mathrm{NAND}\left({I}_{1}, {I}_{2}\right), \mathrm{NAND}\left({I}_{1},{I}_{2}\right)\right)$$ AND I 1 , I 2 = NAND NAND I 1 , I 2 , NAND I 1 , I 2 and $$\mathrm{OR}\left({I}_{1}, {I}_{2}\right)=\mathrm{NAND}\left(\mathrm{NAND}\left({I}_{1}, {I}_{1}\right), \mathrm{NAND}\left({I}_{2},{I}_{2}\right)\right)$$ OR I 1 , I 2 = NAND NAND I 1 , I 1 , NAND I 2 , I 2 , respectively. We also designed an all-optical half-adder that takes two logical values as input and returns their sum and the carry using cascaded diffractive NAND gates. Cascadable all-optical NAND gates composed of spatially-engineered passive diffractive layers can serve optical computing platforms.
Abstract licence: CC BY-NC-ND
References43
40 more references, whose wording the paper’s licence keeps private.
All 43 referencesReads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.