Network Flow Based BSM Asssignment

in current industry practice, Bottom Surface Metals (BSMs) assignment for high frequency signals on a package device is a tedious manual job. One often needs to change the assignment multiple times in order to produce a routable solution. This paper proposes a network flow based method to assign BSMs automatically. It constructs a network flow graph based on available routing resource, honoring constraints such as wiring/BSM blockages. Then it derives the BSM assignment from the min-cost max-flow solution. The resulting assignment is optimal in terms of routability and wirelength. In practice, some high speed signals require differential pair routing. This paper proposes a two-step BSM assignment algorithm to handle these differential pair constraints. The first step constructs a bi-partite graph which solves the BSM pairing problem automatically. The second step constructs a scaled flow graph to assign BSM pairs to differential pairs. Compared to the manual approach, these methods can provide an optimized solution which also significantly reduces the turn around time of board design process from days to seconds.

By: Hua Xiang; Haoxing Ren; Tingdong Zhou

Published in: RC24663 in 2008


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to .