• DocumentCode
    2751490
  • Title

    A range searching engine for VLSI design CAE

  • Author

    Chang, Shir-Shen ; Rose, K.

  • Author_Institution
    Center for Integr. Electron., Rensselaer Polytech. Inst., Troy, NY, USA
  • fYear
    1989
  • fDate
    17-19 May 1989
  • Firstpage
    291
  • Lastpage
    296
  • Abstract
    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
  • Keywords
    CAD/CAM; VLSI; circuit CAD; computational complexity; microprocessor chips; VLSI design CAE; common data bus; folded binary tree structure; host system; identical nodes; leaf nodes; matched data; range searching engine; range-searching query; time complexity; Binary trees; Computer aided engineering; Process design; Search engines; Software design; Software systems; Software testing; Solid modeling; Switches; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    VLSI Technology, Systems and Applications, 1989. Proceedings of Technical Papers. 1989 International Symposium on
  • Conference_Location
    Taipei
  • Type

    conf

  • DOI
    10.1109/VTSA.1989.68632
  • Filename
    68632