Partitioned Matrix Algorithms for VLSI Arithmetic Systems
- 1 December 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (12), 1215-1224
- https://doi.org/10.1109/tc.1982.1675945
Abstract
A new class of partitioned matrix algorithms is developed for possible VLSI implementation of large-scale matrix solvers. Fast matrix solvers are higherly demanded in signal/image processing and in many real-time and scientific applications. Only a few functional types of VLSI arithmetic chips are needed for submatrix computations after partitioning. This partitioned approach is not restricted by problem sizes and thus can be applied to solve arbitrarily large linear systems of equations in an iterative fashion. The following four matrix computations are shown systematically partitionable into submatrix operations, which are feasible for direct VLSI implementation.Keywords
This publication has 8 references indexed in Scilit:
- VLSI architectures for feature extraction and pattern classificationComputer Vision, Graphics, and Image Processing, 1983
- Partitioned algorithms and VLSI structures for large-scale matrix computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1981
- Vector Computer Architecture and Processing TechniquesPublished by Elsevier BV ,1981
- VLSI Processor Arrays for Matrix ManipulationPublished by Springer Science and Business Media LLC ,1981
- Systems of Linear EquationsPublished by Springer Science and Business Media LLC ,1980
- Decentralized parallel algorithms for matrix computationPublished by Association for Computing Machinery (ACM) ,1978
- On Stable Parallel Linear System SolversJournal of the ACM, 1978
- A Short Method for Evaluating Determinants and Solving Systems of Linear Equations With Real or Complex CoefficientsTransactions of the American Institute of Electrical Engineers, 1941