CLUSTER-BASED ASSOCIATIVE MEMORIES BUILT FROM UNRELIABLE STORAGE

We consider associative memories based on clustered graphs that were recently introduced. These memories are almost optimal in terms of the amount of storage they require (effi-ciency), and allow retrieving messages with low complexity. We study an unreliable implementation of the memory and compare its error rate and storage efficiency with that of a re-liable implementation. We present analytical and simulation results that indicate that the proposed memory structure can tolerate a large number of faults at a reasonable cost, thereby making it a good candidate for achieving highly efficient cir-cuit implementations of associative memories. 1