• DocumentCode
    912705
  • Title

    An Approach to Topological Pin Assignment

  • Author

    Brady, H. Nelson

  • Author_Institution
    V. R. Information Systems, Inc., Austin, TX, USA
  • Volume
    3
  • Issue
    3
  • fYear
    1984
  • fDate
    7/1/1984 12:00:00 AM
  • Firstpage
    250
  • Lastpage
    255
  • Abstract
    One of the methods of increasing routability of an integrated circuit or printed circuit board, is to improve the assignment of connection nets to component (gate, chip, etc.) pins. The quality of a pin assignment is judged based on factors such as predicted wire length, wiring crossovers, and wiring congestion. This paper describes topological heuristic algorithms for pin assignment. Two stages, initial pin assignment and assignment improvement, are described in detail. For all cases, example diagrams are provided. The heuristic approaches demonstrated are highly tunable to specific routers.
  • Keywords
    Heuristic algorithms; Information systems; Performance analysis; Pins; Printed circuits; Routing; Shape; Tunable circuits and devices; Wire; Wiring;
  • fLanguage
    English
  • Journal_Title
    Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0278-0070
  • Type

    jour

  • DOI
    10.1109/TCAD.1984.1270082
  • Filename
    1270082