A range searching engine for VLSI design CAE
The design of a VLSI (very-large-scale integration) chip for a range-searching engine is described. The chips are connected as identical nodes in a folded binary tree structure, and all leaf nodes are lined to a common data bus which reports the matched data to the host system. A software system for VLSI design that is based on the range-searching engine concepts has been built and tested. The results show that an O(R+k+log N) time complexity for a range-searching query is achieved.<<ETX>>