Istituto di Scienza e Tecnologie dell'Informazione     
Codenotti B., Lotti G. VLSI linear transformations of banded matrices. Internal note IEI-B84-17, 1984.
The complexity of the multiplication of a banded matrix by a vector is studied with respect to the VLSI model. Upper and lower bounds are showed, which improve the known results. An upper bound, which is optimal up to logarithmic factors, is obtained for the case of fixed band.
Subject VLSI design
Area-Time Complexity
Banded Matrix
Recursive Algorithm

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional