It is studied the matrix-vector multiplication problem in VLSI. Both lower and upper bounds are derived which depend on the chosen model, obtained by different I/O conventions. The problems of multiplying a sparse matrix by a vector is taken into consideration as well. the results obtained for matrix-vector product are applied to study the VLSI complexity of other numerical problems.
Area-time complexity of matrix-vector multiplication
Codenotti B;
1986
Abstract
It is studied the matrix-vector multiplication problem in VLSI. Both lower and upper bounds are derived which depend on the chosen model, obtained by different I/O conventions. The problems of multiplying a sparse matrix by a vector is taken into consideration as well. the results obtained for matrix-vector product are applied to study the VLSI complexity of other numerical problems.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_419878-doc_148589.pdf
accesso aperto
Descrizione: Area-time complexity of matrix-vector multiplication
Dimensione
922.39 kB
Formato
Adobe PDF
|
922.39 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
