Placement algorithms for custom VLSI

  • Authors:
  • Kenneth J. Supowit;Eric A. Slutz

  • Affiliations:
  • -;-

  • Venue:
  • Computer-Aided Design
  • Year:
  • 1984

Quantified Score

Hi-index 0.01

Visualization

Abstract

Algorithms are presented for placement and for modifying existing placements to be used in channel routing solutions for custom VLSI layout. The placements are produced so as not to have channel routing order constraint cycles, which constitute a familiar problem for custom VLSI. The algorithms are based on mathematical results characterizing the structure of channel routing order constraints.