Area-period tradeoffs for multiplication of rectangular matrices

Ferng Ching Lin*, I-Chen Wu

*此作品的通信作者

研究成果: Article同行評審

2 引文 斯高帕斯(Scopus)

摘要

A VLSI computation model is presented with a time dimension in which the concept of information transfer is made precise and memory requirements (lower bounds for A) and area-period trade-offs (lower bounds for AP2) are treated uniformly. By employing the transitivities of cyclic shiftings and binary multiplication it is proved that AP = ω((min(mn, mp, np)l)1 + α), 0 ≤5 α ≤ 51, for the problem of multiplying m × n and n × p matrices of l-bit elements. We also show that min(mn, mp,np)l is the exact bound for chip area.

原文English
頁(從 - 到)329-342
頁數14
期刊Journal of Computer and System Sciences
30
發行號3
DOIs
出版狀態Published - 1 一月 1985

指紋

深入研究「Area-period tradeoffs for multiplication of rectangular matrices」主題。共同形成了獨特的指紋。

引用此