Cart (Loading....) | Create Account
Close category search window
 

Fast method for updating robust pseudoinverse and Ho-Kashyap associative processors

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Telfer, B.A. ; Dept. of Electr. Eng., Carnegie Mellon Univ., Pittsburgh, PA, USA ; Casasent, David P.

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

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:24 ,  Issue: 9 )

Date of Publication:

Sep 1994

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.