http://iet.metastore.ingenta.com
1887

Systolic array for all-nearest-neighbours problem

MyBook is a cheap paperback edition of the original book and will be sold at uniform, low price.
Buy article PDF
$23.94
Buy Knowledge Pack
10 articles for $144.00

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%.

References

    1. 1)
      • F.P. Preparata , M.I. Shamos . (1985) , Computational geometry.
    2. 2)
      • B. Chazelle . Computational geometry on a systolic chip. IEEE Trans. , 774 - 785

Related content

content/journals/10.1049/el_19870874
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address