Title :
Systolic array for all-nearest-neighbours problem
Author_Institution :
Central Institute for Cybernetics & Information Processes, International Basic Laboratory for Image Processing & Computer Graphics, Berlin, East Germany
Abstract :
The all-nearest-neighbours (ANN) problem is a fundamental problem in computational geometry. In the letter a new two-dimensional triangular systolic array with mesh-connected cells is proposed for the ANN problem. This array can process a queue of ANN problems at a throughput of one ANN problem per time period, with an efficiency of 100%.
Keywords :
cellular arrays; computational geometry; parallel architectures; ANN problem; all-nearest-neighbours problem; computational geometry; efficiency; mesh-connected cells; throughput; two-dimensional triangular systolic array;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19870874
