Share Email Print

Proceedings Paper

Uni-complex and bi-complex representation for associative memory with superior retrieval
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A novel uni-complex valued trinary associative model, which is implementable in the optical domain, is proposed. Retrieval of the stored pattern is accomplished using an threshold formula in the inner product domain. An algorithm to determine adaptive threshold formula for this trinary associative memory model is presented. The optimal threshold is chosen to yield the best performance. Different threshold parameters have been investigated to obtain the range of optimal threshold parameters. In order to validate our performance model, character recognition problem with noisy and noise-free data are investigated. Moreover, a bi-complex representation model for associative memory retrieval is presented and compared to previous methods.

Paper Details

Date Published: 15 November 2002
PDF: 12 pages
Proc. SPIE 4788, Photonic Devices and Algorithms for Computing IV, (15 November 2002); doi: 10.1117/12.453728
Show Author Affiliations
Abdul Ahad Sami Awwal, Lawrence Livermore National Lab. (United States)
Haiying Tang, Wright State Univ. (United States)
Karl Solvi Gudmundsson, Wright State Univ. (United States)
Javed I. Khan, Kent State Univ. (United States)

Published in SPIE Proceedings Vol. 4788:
Photonic Devices and Algorithms for Computing IV
Khan M. Iftekharuddin; Abdul Ahad S. Awwal, Editor(s)

© SPIE. Terms of Use
Back to Top