Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

New implementation of complete symbolic substitution for digital optical computing

Not Accessible

Your library or personal account may give you access

Abstract

Earlier methods in complete symbolic substitution logic used several techniques for coding the binary values. We propose a coding-free method which is designed by using the input and its inverted pattern to recognize both 0 and 1 simultaneously.

© 1989 Optical Society of America

Full Article  |  PDF Article
More Like This
Digital optical computing with symbolic substitution

Karl-Heinz Brenner, Alan Huang, and Norbert Streibl
Appl. Opt. 25(18) 3054-3060 (1986)

New implementation of symbolic substitution logic

Karl-Heinz Brenner
Appl. Opt. 25(18) 3061-3064 (1986)

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (4)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (2)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.