• DocumentCode
    285664
  • Title

    Gate matrix multiple-folding algorithm [for CMOS VLSI]

  • Author

    Yamada, Shoichiro ; Nakayama, Shunichi

  • Author_Institution
    Dept. of Electr. Eng., Osaka Prefecture Univ., Sakai, Osaka, Japan
  • Volume
    4
  • fYear
    1992
  • fDate
    3-6 May 1992
  • Firstpage
    2001
  • Abstract
    The authors propose a new multiple-folding algorithm for the gate matrix layout. It was applied to generation of rectangular blocks with a flexible size. The algorithm consists of two phases, net partitioning and the gate arrangement, and both are based on the generalized minicut technique. In the first and second phases, the width and height of the multiple-folded gate matrix block are directly minimized, respectively, such that the area is minimized and the desired aspect ratio of the block is obtained. The experimental results showed the effectiveness of the algorithm
  • Keywords
    CMOS integrated circuits; VLSI; circuit layout CAD; logic CAD; area; aspect ratio; flexible size; gate arrangement; gate matrix layout; generalized minicut technique; multiple-folding algorithm; net partitioning; rectangular blocks; Circuits; Educational institutions; Iterative algorithms; Partitioning algorithms; Phase estimation; Routing; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 1992. ISCAS '92. Proceedings., 1992 IEEE International Symposium on
  • Conference_Location
    San Diego, CA
  • Print_ISBN
    0-7803-0593-0
  • Type

    conf

  • DOI
    10.1109/ISCAS.1992.230384
  • Filename
    230384