Ho-Kashyap Associative Processors

Abstract

A Ho-Kashyap (H-K) associative processor (AP) is demonstrated to have a larger storage capacity than the pseudoinverse AP and to allow linearly dependent key vectors to be accurately stored. A new Robust H-K AP is shown to perform well over all M/N (where M is the number of keys and N is their dimension), specifically when M ≈ N, where the standard pseudoinverse and H-K APs perform poorly. Also considered are variable thresholds, an error-correcting algorithm to allow analog synthesis of the H-K AP, and the different reliabilities of the recollection elements.