30 July 1982 Scattering Arrays For Matrix Computations
Author Affiliations +
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.
© (1982) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jean-Marc Delosme, Jean-Marc Delosme, Martin Morf, Martin Morf, } "Scattering Arrays For Matrix Computations", Proc. SPIE 0298, Real-Time Signal Processing IV, (30 July 1982); doi: 10.1117/12.932514; https://doi.org/10.1117/12.932514
PROCEEDINGS
10 PAGES


SHARE
RELATED CONTENT

A Novel MVDR Beamforming Algorithm
Proceedings of SPIE (January 20 1988)
Convergence Of Parallel Block Jacobi Methods
Proceedings of SPIE (February 22 1988)
Implementation Of Cellular Arrays
Proceedings of SPIE (July 29 1982)
The Solution Of Singular Value Problems Using Systolic Arrays
Proceedings of SPIE (November 27 1984)

Back to Top