Area-period tradeoffs for multiplication of rectangular matrices

DOI10.1016/0022-0000(85)90050-9zbMath0569.68032OpenAlexW2033805302MaRDI QIDQ1060844

I-Chen Wu, Ferng-Ching Lin

Publication date: 1985

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(85)90050-9

zbMATH Keywords

memory requirementsmatrix multiplicationinformation transferchip areacyclic shiftingsVLSI computation model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

The communication complexity of several problems in matrix computation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Area-time optimal VLSI networks for multiplying matrices
• Area-time tradeoffs for matrix multiplication and related problems in VLSI models
• Information transfer and area-time tradeoffs for VLSI multiplication
• The Area-Time Complexity of Binary Multiplication
• Some Area-Time Tradeoffs for VLSI

This page was built for publication: Area-period tradeoffs for multiplication of rectangular matrices