Share Email Print

Proceedings Paper

Scattering Arrays For Matrix Computations
Author(s): Jean-Marc Delosme; Martin Morf
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Several new mesh connected multiprocessor architectures are presented that are adapted to execute highly parallel algorithms for matrix alge-bra and signal processing, such as triangular- and eigen-decomposition, inversion and low-rank updat-ing of general matrices, as well as Toeplitz and Hankel related matrices. These algorithms are based on scattering theory concepts and informa-tion preserving transformations, hence they exhibit local communication, and simple control and memory management, all properties that are ideal for VLSI implementation. The architectures are based on two- dimensional "scattering" arrays, that can be folded into linear arrays, either through time-sharing, or due to simple computation wave-fronts, or due to special structures of the matrices involved, such as Toeplitz.

Paper Details

Date Published: 30 July 1982
PDF: 10 pages
Proc. SPIE 0298, Real-Time Signal Processing IV, (30 July 1982); doi: 10.1117/12.932514
Show Author Affiliations
Jean-Marc Delosme, Stanford University (United States)
Martin Morf, Stanford University (United States)

Published in SPIE Proceedings Vol. 0298:
Real-Time Signal Processing IV
Tien F. Tao, Editor(s)

© SPIE. Terms of Use
Back to Top