Fully efficient systolic arrays for the solution of Toeplitz
matrices using Schur algorithm [1] have been obtained. By applying
clustering mapping method [2], the complexity of the algorithm is
0(n) and it requires n/2 processing elements as opposed to n
processing elements developed elsewhere [1].
The motivation of this thesis is to obtain efficient pipeline
arrays by using the synthesis procedure to implement Toeplitz
matrix solution. Furthermore, we will examine pipeline structures
for the Toeplitz system factorization and back-substitution by
obtaining clustering and Multi-Rate Array structures. These methods
reduce the number of processing elements and enhance the
computational speed. Comparison and advantage of these methods to
other method will be presented. / Graduation date: 1992
| Identifer | oai:union.ndltd.org:ORGSU/oai:ir.library.oregonstate.edu:1957/37297 |
| Date | 11 October 1991 |
| Creators | Lee, Louis Wai-Fung |
| Contributors | Kiaei, Sayfe |
| Source Sets | Oregon State University |
| Language | en_US |
| Detected Language | English |
| Type | Thesis/Dissertation |
Page generated in 0.0018 seconds