Share Email Print

Proceedings Paper

Old And New Algorithms For Toeplitz Systems
Author(s): Richard P. Brent
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Toeplitz linear systems and Toeplitz least squares problems commonly arise in digital signal processing. In this paper we survey some old, "well known" algorithms and some recent algorithms for solving these problems. We concentrate our attention on algorithms which can be implemented efficiently on a variety of parallel machines (including pipelined vector processors and systolic arrays). We distinguish between algorithms which require inner products, and algorithms which avoid inner products, and thus are better suited to parallel implementation on some parallel architectures. Finally, we mention some "asymptotically fast" 0(n(log n)2) algorithms and compare them with 0(n2) algorithms.

Paper Details

Date Published: 23 February 1988
PDF: 8 pages
Proc. SPIE 0975, Advanced Algorithms and Architectures for Signal Processing III, (23 February 1988); doi: 10.1117/12.948485
Show Author Affiliations
Richard P. Brent, Australian National University (Australia)

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
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?