Issue No.01 - January (1992 vol.41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.123385
<p>The authors present a systolic algorithm and its variations for the k-nearest neighbors problem (kNNP). Multiple-shot queries with different ranges (k values) can be served in a pipelined fashion. A partitioning scheme is developed to handle large size problems. Performance of the algorithm is analyzed. Formulas for the optimal array size in terms of computation time and area-time-time product (ATT) are derived. The algorithm can solve a multiple-shot kNNP in N+2 square root N*K systolic steps using square root N*K processing elements, where N is the problem size (i.e. the number of points), and K is the sum of all k-values.</p>
multiple-shot queries; systolic algorithm; k-nearest neighbors problem; partitioning scheme; optimal array size; computation time; area-time-time product; computational geometry; systolic arrays.
Yirng-An Chen, Long-Wen Chang, "A Systolic Algorithm for the k-Nearest Neighbors Problem", IEEE Transactions on Computers, vol.41, no. 1, pp. 103-108, January 1992, doi:10.1109/12.123385