An even faster systolic array for matrix multiplication
From MaRDI portal
Publication:1263246
DOI10.1016/0167-8191(89)90057-4zbMath0687.65043MaRDI QIDQ1263246
Yves Robert, Abdelhamid Benaini
Publication date: 1989
Published in: Parallel Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-8191(89)90057-4
complexity; feedback; systolic array; VLSI implementation; matrix multiplication; Winograd's algorithm
68Q25: Analysis of algorithms and problem complexity
68Q80: Cellular automata (computational aspects)
Related Items
N latency 2N I/O‐bandwidth 2D‐array matrix multiplication algorithm, Mapping full‐systolic arrays for matrix product on XILINX's XC4000(E,EX) FPGAs