Share Email Print

Proceedings Paper

Systolic Array For Solving Toeplitz Systems Of Equations
Author(s): J. Chun; V. Roychowdhury; T. Kailath
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Many problems of geophysics, image processing and time series analysis involve the problem of solving Toeplitz systems of equations. We present a fast parallel 0 (mn) algorithm that solves both square and over-determined Toeplitz systems of equations. The solution is obtained directly from the triangular factorization without using back-substitution. This avoids separate factorization and back-substitution sections, which complicate architectural implementation. This also enables us to eliminate intermediate memory to store the triangular factor. The parallel implementation is carried out in two steps. First, Regular Iterative Algorithms (RIAs) for solving Toeplitz system of equations are formulated systematically from the mathematical description of our algorithm. The advantage of having RIAs is that the process of mapping the algorithms on regular processor arrays can be done in a systematic manner.

Paper Details

Date Published: 23 February 1988
PDF: 9 pages
Proc. SPIE 0975, Advanced Algorithms and Architectures for Signal Processing III, (23 February 1988); doi: 10.1117/12.948487
Show Author Affiliations
J. Chun, Stanford University (United States)
V. Roychowdhury, Stanford University (United States)
T. Kailath, Stanford University (United States)

Published in SPIE Proceedings Vol. 0975:
Advanced Algorithms and Architectures for Signal Processing III
Franklin T. Luk, Editor(s)

© SPIE. Terms of Use
Back to Top