Return to search

Fully efficient pipelined VLSI arrays for solving toeplitz matrices

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

Identiferoai:union.ndltd.org:ORGSU/oai:ir.library.oregonstate.edu:1957/37297
Date11 October 1991
CreatorsLee, Louis Wai-Fung
ContributorsKiaei, Sayfe
Source SetsOregon State University
Languageen_US
Detected LanguageEnglish
TypeThesis/Dissertation

Page generated in 0.0017 seconds