Based on the techniques of singular value decomposition and generalize
d inverse, two new methods for designing associative memories are pres
ented. The two methods not only guarantee that each given vector is an
equilibrium point of the network, but also guarantee the asymptotic s
tability of the equilibrium points. Examples show the effectiveness of
the new methods.