Presentation 2015-03-03
A Length Matching Routing Method for Disordered Pins in PCB Design
Ran Zhang, Tieyuan Pan, Li Zhu, Takahiro Watanabe,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this paper, for the disordered pins in printed circuit board (PCB) design, a heuristics algorithm is proposed to obtain a length matching routing. We initially check the longest common subsequence of pin pairs to assign layers for pins. Then, adopt single commodity flow to generate base routes. R-flip and C-flip are finally carried out to adjust the wire length. The experiments show that our algorithm generates the optimal routes with better wire balance within reasonable CPU times.
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # VLD2014-171
Date of Issue

Conference Information
Committee VLD
Conference Date 2015/2/23(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 VLSI Design Technologies (VLD)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Length Matching Routing Method for Disordered Pins in PCB Design
Sub Title (in English)
Keyword(1)
1st Author's Name Ran Zhang
1st Author's Affiliation Graduate School of Information, Production and Systems Waseda University()
2nd Author's Name Tieyuan Pan
2nd Author's Affiliation Graduate School of Information, Production and Systems Waseda University
3rd Author's Name Li Zhu
3rd Author's Affiliation Graduate School of Information, Production and Systems Waseda University
4th Author's Name Takahiro Watanabe
4th Author's Affiliation Graduate School of Information, Production and Systems Waseda University
Date 2015-03-03
Paper # VLD2014-171
Volume (vol) vol.114
Number (no) 476
Page pp.pp.-
#Pages 6
Date of Issue