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

Parallel VLSI algorithm for stable inversion of dense matrices

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 $31
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)
El-Amawy, A. ; Dept. of Electr. & Comput. Eng., Louisiana State Univ., Baton Rouge, LA, USA ; Dharmarajan, K.R.

A fast, efficient, parallel algorithm for stable matrix inversion based on Givens plane rotations is described. The algorithm is implemented on VLSI systolic architecture that is capable of inverting any n*n nonsingular dense matrix in 5n units of time, including I/O time. The array architecture consists of n2+n processing elements (PEs) arranged as a cascade of two triangular arrays of (n2+n)/2 PEs each. The parallel algorithm involves the following processes: QR-decomposition by the Givens rotations technique; inversion of the upper triangular matrix R and multiplication of R-1 by Q. All three components of the algorithm are maximally overlapped with no need for intermediate I/O or global communications. A novel technique for concurrently inverting distinct matrices on the same array has also been suggested. This technique, based on the use of two levels of pipelining, significantly improves the array throughput. The execution speed of the algorithm matches that of the fastest systolic implementation of matrix inversion using Gaussian elimination without pivoting (which is unstable in most cases) reported to date.

Published in:

Computers and Digital Techniques, IEE Proceedings E  (Volume:136 ,  Issue: 6 )

Date of Publication:

Nov 1989

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.