PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Lotti G. Area-time tradeoff for rectangular matrix multiplication in VLSI models. Internal note IEI-B83-06, 1983.
 
 
Abstract
(English)
The square nxn matrix multiplication problem in VLSI models has been investigated by several authors [1-5]. The lower anda upper bound to the tradeoff AT^2 between chip area A and computation time T is n^4.
Subject VLSI
matrix multiplication
area-time complexity


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