DocumentCode
1806832
Title
Simultaneous Constrained Pin Assignment and Escape Routing for FPGA-PCB Codesign
Author
Lei, Seong-I ; Mak, Wai-Kei
Author_Institution
Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
fYear
2011
fDate
5-7 Sept. 2011
Firstpage
435
Lastpage
440
Abstract
With the increasing complexity of circuit design in recent years, the pin assignment and escape routing problems for FPGA on a PCB have become greatly difficult due to the fast increase in pin count and density. Most existing works only focus on either the FPGA pin assignment problem or the PCB escape routing problem independently but cannot handle them simultaneously. In this paper, we propose an integer linear programming (ILP) based method to simultaneously solve the pin assignment and escape routing problems for FPGA-PCB code sign. Because of the underlying network structure of our formulation, we can solve the problem efficiently. Experimental results demonstrate that our method can achieve an average 54.5% wire length improvement over the common two-stage approach.
Keywords
field programmable gate arrays; integer programming; linear programming; network routing; printed circuit design; FPGA-PCB codesign; common two-stage approach; constrained pin assignment; escape routing; integer linear programming based method; pin count; pin density; Equations; Field programmable gate arrays; Mathematical model; Pins; Routing; Standards; Tiles; Constrained Pin Assignment; Escape Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Field Programmable Logic and Applications (FPL), 2011 International Conference on
Conference_Location
Chania
Print_ISBN
978-1-4577-1484-9
Electronic_ISBN
978-0-7695-4529-5
Type
conf
DOI
10.1109/FPL.2011.86
Filename
6044859
Link To Document