Pin assignment and routing on a single-layer pin grid array

Author

Yu, Man-Fai ; Dai, Wayne Wei-Ming

Author_Institution

Dept. of Comput. Eng., California Univ., Santa Cruz, CA, USA

fYear

1995

fDate

29 Aug-1 Sep 1995

Firstpage

203

Lastpage

208

Abstract

PGA routing has the freedom of routing any pin to any pad. We propose an algorithm (EVENPGA) that generates a monotonic topological routing. The routing has no detours and is uniformly distributed optimally. The wire length is also the shortest possible under the taxicab wiring metric. If the topological routing is routable, the maximum density of critical cuts along a ring is the minimum possible. Once the topological routing is done, physical layout can easily be obtained using Surf, a rubberband-based routing system

Keywords

circuit layout CAD; integrated circuit packaging; network routing; network topology; EVENPGA; Surf; algorithm; circuit layout; critical cuts; maximum density; monotonic topological routing; pin assignment; pin routing; rubberband-based routing system; single-layer pin grid array routing; taxicab wiring metric; topological routing; uniform distribution; wire length; Algorithm design and analysis; Bonding; Electronics packaging; Geometry; Iterative algorithms; Iterative methods; Pins; Routing; Wire; Wiring;

fLanguage

English

Publisher

ieee

Conference_Titel

Design Automation Conference, 1995. Proceedings of the ASP-DAC '95/CHDL '95/VLSI '95., IFIP International Conference on Hardware Description Languages. IFIP International Conference on Very Large Scal

Conference_Location

Chiba

Print_ISBN

4-930813-67-0

Type

conf

DOI

10.1109/ASPDAC.1995.486224

Filename

486224