Highly concurrent algorithm and pipelined architecture for solving Toeplitz systems
The design of VLSI parallel processors requires a fundamental understanding of the parallel computing algorithm and an appreciation of the implementational constraint on communications. Based on such consideration, the authors develop a highly concurrent Toeplitz system solver, featuring maximum parallelism and localized communication. More precisely, a highly parallel algorithm is proposed which achieves o(n) computing time with a linear array of o(n) processors. This compares very favourbly to the o(n log/sub 2/ n) computing time attainable with the traditional levinson algorithm implemented in parallel. Furthermore, to comply with the communication constraint, a pipelined processor architecture is proposed which uses only localized interconnections and yet retains the maximum parallelism attainable. 36 references.
- Research Organization:
- Univ. of Southern California, Los Angeles
- OSTI ID:
- 5083962
- Journal Information:
- IEEE Trans. Acoust., Speech, Signal Process.; (United States), Journal Name: IEEE Trans. Acoust., Speech, Signal Process.; (United States); ISSN IETAB
- Country of Publication:
- United States
- Language:
- English
Similar Records
Systolic algorithms for the parallel solution of dense symmetric positive-definite Toeplitz systems. Research report
A parallel algorithm for solving periodic tridiagonal Toeplitz linear systems