| Presentation | 2007-03-08 BGA Routing by The Potential Router Takayuki HIROMATSU, Masato INAGI, Yasuhiro TAKASHIMA, Yoji kAJITANI, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | As the number of devices in an LSI chip becomes larger, the number of package pins also becomes larger. To fold the pins in the chip area, Ball Grid Array (BGA) packages are widely used. However, since the constrinats of the routing problem in BGA is too much and complicated, it is hard to design it manually. In this paper, we propose a novel routing algorithm for Pads on the In-most model (PoI) to minimize the total number of routes between adjacent pins, which has a strong relation with the minimum total wire length. We assume that i) the number of layers is one, ii) no assignment of nets to pads exists, and iii) the constraint of the number of nets between adjacent pins is given. For this problem, a novel representation of planar routing, called potential routing method, is used. On the potential routing, when a potential is assigned to each ball under the no-saddle constraint, the route of the ball is determined uniquely. Our algorithm is a heuristics based on the potential method. In addition, we compared the proposed method with SA-based algorithm also based on potential method. As a result, the proposed method output the less number of routes than that by SA-based algorithm. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Ball Grid Array (BGA) / Potential router / Monotonic routing / Design rules / No-saddle constraints / Single layer routing / Net assignment |
| Paper # | VLD2006-131,ICD2006-222 |
| Date of Issue |
| Conference Information | |
| Committee | ICD |
|---|---|
| Conference Date | 2007/3/1(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Integrated Circuits and Devices (ICD) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | BGA Routing by The Potential Router |
| Sub Title (in English) | |
| Keyword(1) | Ball Grid Array (BGA) |
| Keyword(2) | Potential router |
| Keyword(3) | Monotonic routing |
| Keyword(4) | Design rules |
| Keyword(5) | No-saddle constraints |
| Keyword(6) | Single layer routing |
| Keyword(7) | Net assignment |
| 1st Author's Name | Takayuki HIROMATSU |
| 1st Author's Affiliation | Department of Infromation and Media Sciences, Faculty of Environmental Engineering, The University of Kitakyushu() |
| 2nd Author's Name | Masato INAGI |
| 2nd Author's Affiliation | Department of Infromation and Media Sciences, Faculty of Environmental Engineering, The University of Kitakyushu |
| 3rd Author's Name | Yasuhiro TAKASHIMA |
| 3rd Author's Affiliation | Department of Infromation and Media Sciences, Faculty of Environmental Engineering, The University of Kitakyushu |
| 4th Author's Name | Yoji kAJITANI |
| 4th Author's Affiliation | Department of Infromation and Media Sciences, Faculty of Environmental Engineering, The University of Kitakyushu |
| Date | 2007-03-08 |
| Paper # | VLD2006-131,ICD2006-222 |
| Volume (vol) | vol.106 |
| Number (no) | 551 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |