Title :
Fast method for updating robust pseudoinverse and Ho-Kashyap associative processors
Author :
Telfer, Brian A. ; Casasent, David P.
Author_Institution :
Dept. of Electr. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA
fDate :
9/1/1994 12:00:00 AM
Abstract :
A new approximate method is proposed for updating robust pseudoinverse and Ho-Kashyap associative processors. The method can both add and delete vectors. It is faster than existing methods for updating the standard pseudoinverse associative processor, in addition to operating on a preferable robust associative processor. The new method is based on the matrix inversion lemma. Update algorithms are also noted that are suitable for reduced accuracy (analog) processors and for pipelined array processors
Keywords :
content-addressable storage; inverse problems; matrix algebra; microprocessor chips; parallel processing; pipeline processing; Ho-Kashyap associative processors; matrix inversion; pipelined array processors; reduced accuracy processors; robust pseudoinverse processors; update algorithms; Data processing; Optical distortion; Robustness; Silver; Springs;
Journal_Title :
Systems, Man and Cybernetics, IEEE Transactions on
