Computational geometry: an introduction
Computational geometry: an introduction
Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
IEEE Transactions on Computers
Memory requirements for balanced computer architectures
ISCA '86 Proceedings of the 13th annual international symposium on Computer architecture
Broadcast Normalization in Systolic Design
IEEE Transactions on Computers
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
| Hi-index | 14.98 |
A systolic array for enumerating keys in n keys in 3n-1 time steps is introduced. This array has unidirectional data flow and achieves the maximum data pipelining rate. Modifications of the array for solving the closest-neighbor problems in computational geometry are presented.