A family of new efficient arrays for matrix multiplication

DOI10.1109/12.8739zbMath0664.65039OpenAlexW2080275298MaRDI QIDQ3814651

H. V. Jagadish, Thomas Kailath

Publication date: 1989

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.8739

zbMATH Keywords

iterative algorithmsmatrix multiplicationarray processorsWinograd- algorithm

Mathematics Subject Classification ID

Related Items (6)

N latency 2N I/O‐bandwidth 2D‐array matrix multiplication algorithm ⋮ MODULAR FIXED-SIZE VLSI ARCHITECTURES FOR GENERAL MULTISPLITTING ITERATION ⋮ Forty-three ways of systolic matrix multiplication ⋮ Nineteen ways of systolic matrix multiplication ⋮ THE MAGIC OF INTERLOCKING PROPERTY: FAST SYSTOLIC DESIGN ⋮ Mapping full‐systolic arrays for matrix product on XILINX's XC4000(E,EX) FPGAs

This page was built for publication: A family of new efficient arrays for matrix multiplication