Pin assignment of circuit cards and the routability of multilayer printed wiring backplanes
DAC '73 Proceedings of the 10th Design Automation Workshop
Pin assignment in automated printed circuit board design
DAC '72 Proceedings of the 9th Design Automation Workshop
Design automation and the WRAP System
DAC '68 Proceedings of the 5th annual Design Automation Workshop
Embedded pin assignment for top down system design
EURO-DAC '92 Proceedings of the conference on European design automation
Automatic placement a review of current techniques (tutorial session)
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Automatic intra-device pin & element reassignment (AIDPER) algorithm
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
An approach to pin assignment in printed circuit board design
ACM SIGDA Newsletter
An algorithm for simultaneous pin assignment and routing
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Novel pin assignment algorithms for components with very high pin counts
Proceedings of the conference on Design, automation and test in Europe
Package routability- and IR-drop-aware finger/pad assignment in chip-package co-design
Proceedings of the Conference on Design, Automation and Test in Europe
Optimal simultaneous pin assignment and escape routing for dense PCBs
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
Package routability- and IR-drop-aware finger/pad planning for single chip and stacking IC designs
Integration, the VLSI Journal
| Hi-index | 0.00 |
The design of a Printed Circuit Board is complete when the board is routed. All effort prior to activating the router is aimed at insuring successful routing, often involving the following steps: 1) Assigning elements to packages (this is known as the assignment problem). 2) Placing the packages on the board (the placement problem). 3) Assigning the connections of the nets to specific pins on the packages (the pin assignment problem). Each of these steps is designed to help produce a routable board. This paper describes a method of solving the pin assignment problem that achieves routability of the board by reducing prospective wire crossings. Routability is improved by ordering the nets to be assigned to a specific set of pins according to their location relative to this set of pins, and then assigning them, in this order, to the nearest available pin.