Maximum Alignment of Interchangeable Terminals

  • Authors:
  • L.-S. Lin;S. Sahni

  • Affiliations:
  • AT&T Bell Labs, Murray Hill, NJ;Univ. of Minnesota, Minneapolis

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1988

Quantified Score

Hi-index 14.98

Visualization

Abstract

The authors develop a linear algorithm to maximize the number of terminals aligned across a routing channel. It is assumed that the terminals in the cells on either side of the channel are interchangeable. This algorithm has application to the routing of PLAs and other circuits with interchangeable terminals.