Recent research development in PCB layout
- 1 November 2010
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10923152,p. 398-403
Abstract
The increasing complexity of electronic systems has made PCB layout a difficult problem. A large amount of research efforts are dedicated to the study of this problem. In this paper, we provide an overview of recent research results on the PCB layout problem. We focus on the escape routing problem and the length-matching routing problem, which are the two most important problems in PCB layout. Other relevant works are also briefly introduced.Keywords
This publication has 26 references indexed in Scilit:
- Two-sided single-detour untangling for bus routing2010
- BSG-Route: A Length-Constrained Routing Scheme for General Planar TopologyIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2009
- Theories and algorithms on single-detour routing for untangling twisted busACM Transactions on Design Automation of Electronic Systems, 2009
- On using SAT to ordered escape problems2009
- An Integer Linear Programming Based Routing Algorithm for Flip-Chip DesignProceedings of the 39th conference on Design automation - DAC '02, 2007
- Global routing by iterative improvements for two-layer ball grid array packagesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2006
- Layer minimization of escape routing in area array packaging2006 IEEE/ACM International Conference on Computer Aided Design, 2006
- A global routing method for 2-layer ball grid array packages2005
- Pin assignment and routing on a single-layer pin grid array2002
- Module packing based on the BSG-structure and IC layout applicationsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1998