THE MAGIC OF INTERLOCKING PROPERTY: FAST SYSTOLIC DESIGN
From MaRDI portal
Publication:3130159
DOI10.1080/10637199708915617zbMath0873.68089OpenAlexW2094998497MaRDI QIDQ3130159
Publication date: 28 May 1997
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10637199708915617
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68M99) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Implementation of folding transformations on linear VSLI processor arrays
- New linear systolic arrays for digital filters and convolution
- New linear systolic arrays for the string comparison algorithm
- Folding transformations for processor arrays
- Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
- A family of new efficient arrays for matrix multiplication
- Fast linear systolic matrix vector multiplication
- FOLDING TRANSFORMATIONS ON SYSTOLIC AND VLSI PROCESSOR ARRAYS
This page was built for publication: THE MAGIC OF INTERLOCKING PROPERTY: FAST SYSTOLIC DESIGN