Fast coordinates generating circuit for pixel parallel processing

Abstract

AbstractSince the coordinates of multiple points cannot be encoded simultaneously due to the encoder characteristics when encoding the positions of multiple points on a plane as the coordinates, each point must be successively searched for, and each coordinate must be encoded in order. Highly efficient algorithms to search for points on a plane, such as the binary search, are known. These algorithms can be easily implemented in software in general, but are difficult to implement in hardware. In this paper, we propose an algorithm that rapidly searches for the points on a plane and its circuit architecture in order to encode multiple points. We used this proposed circuit in the last stage of a circuit that detects the centroids of objects on a pixel plane and searched for the detected centroids by a circuit simulation in H‐SPICE. From the result, we verified the completion of the search of a 15 × 15‐pixel plane in several microseconds. Since the processing time of this algorithm depends, in theory, on the number of points to be searched for and not on the number of pixels on the pixel plane, even as the number of pixels on the pixel plane to be searched increases, the processing time does not increase dramatically. Therefore, this algorithm is also effective as the resolution improves. © 2002 Wiley Periodicals, Inc. Electron Comm Jpn Pt 2, 85(6): 27–32, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjb.1109