• DocumentCode
    1037976
  • Title

    Systolic array for all-nearest-neighbours problem

  • Author

    Petkov, N.

  • Author_Institution
    Central Institute for Cybernetics & Information Processes, International Basic Laboratory for Image Processing & Computer Graphics, Berlin, East Germany
  • Volume
    23
  • Issue
    24
  • fYear
    1987
  • Firstpage
    1259
  • 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;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19870874
  • Filename
    4259115
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1037976