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

Optical Window Addressable Memory Processing

Not Accessible

Your library or personal account may give you access

Abstract

An electro-optic approach to the selection of the closest match between an object described by a feature vector and a set of known feature vectors is described. The problem is formulated as parallel vector-matrix multipliers and a summing operation of the form: Typical problems usually do not call for an exceptionally rapid update of the stored information, while the rapid sorting operation is generally a strong requirement. These conditions can be satisfied with currently available technology. An implementation is described in which feature vector data is stored on a liquid crystal device utilized as a window addressable memory. A description of breadboard hardware is given. Preliminary test results support the overall feasibility of the approach.

© 1985 Optical Society of America

PDF Article
More Like This
Multi-Level Coded Residue-Based Content-Addressable-Memory Optical Computing

M. M. Mirsalehi and T. K. Gaylord
WB1 Optical Computing (IP) 1985

Architectures for optical implementation of 2-D content addressable memories

Nabil H. Farhat and Demetri Psaltis
WT3 OSA Annual Meeting (FIO) 1985

Content addressable memory with smooth transition and adaptive thresholding

K. S. Lee and Nabil H. Farhat
WJ35 OSA Annual Meeting (FIO) 1985

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.