By Topic

Efficient architectures to recover the regularized least squares solution

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

1 Author(s)
Sundaram, R. ; Inf. Syst. Inc., West Lafayette, IN, USA

Several practical applications are concerned with the identification of the least squares (LS) solution. The objective is to attain this solution accurately and efficiently while conserving resources. The computational and storage requirements to determine the LS solution by any iterative procedure become prohibitively large as the problem dimensions grow. This work presents some architectures based on thresholded binary networks which recover regularized LS solutions by partitioning such networks and adopting a switching operation between active and inactive partitions to optimize the objective function. Also, an iterative method based on steepest descent is briefly discussed and implemented. It yields reliable estimates of the regularized LS solution, while providing savings in computation and storage

Published in:

Circuits and Systems II: Analog and Digital Signal Processing, IEEE Transactions on  (Volume:46 ,  Issue: 6 )