New auto-associative memory based on lattice algebra

Abstract

This paper presents a novel, three-stage, auto-associative memory based on lattice algebra. The first two stages of this memory consist of correlation matrix memories within the lattice domain. The third and final stage is a two-layer feed-forward network based on dendritic computing. The output nodes of this feed-forward network yield the desired pattern vector association. The computations performed by each stage are all lattice based and, thus, provide for fast computation and avoidance of convergence problems. Additionally, the proposed model is extremely robust in the presence of noise. Bounds of allowable noise that guarantees perfect output are also discussed. © Springer-Verlag 2004.