SPROUT—Smart Power Routing Tool for Board-Level Exploration and Prototyping
- 30 July 2021
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 41 (7) , 2263-2275
Abstract
The board-level power network design process is governed by system-level parameters such as the number of layers and the ball grid array (BGA) pattern. These parameters influence the characteristics of the resulting system, such as power, speed, and cost. Evaluating the impact of these parameters is, however, challenging. To estimate the reduction in impedance if, for example, additional BGA balls are dedicated to the power delivery system, adjustments to the board layout and an additional impedance extraction process are required. These processes are poorly automated, requiring significant time and labor. Automating power network exploration and prototyping can greatly enhance the board-level power delivery design process by increasing the number of possible design options. With power network exploration and prototyping, the effects of the system parameters on the electrical characteristics can be better understood, providing valuable insight into early stages of the design process. SPROUT – an automated algorithm for prototyping printed circuit board (PCB) power networks – is presented here. This tool includes the first fully automated algorithm for board-level power network layout synthesis. Two board-level industrial power networks are synthesized using SPROUT. The impedance of the resulting layouts exhibits good agreement with manual PCB layouts while significantly reducing the design time. The tool is used to explore area/impedance tradeoffs in a three rail system, providing useful data to enhance the PCB design process.Keywords
Funding Information
- National Science Foundation (CCF-1716091)
- Intelligence Advanced Research Projects Activity (W911NF-17-9-0001)
- Qualcomm
- Synopsys
This publication has 33 references indexed in Scilit:
- A generalization of Dijkstra's shortest path algorithm with applications to VLSI routingJournal of Discrete Algorithms, 2009
- Finding shortest paths on real road networks: the case for A*International Journal of Geographical Information Science, 2009
- Optimal decoupling capacitor sizing and placement for standard-cell layout designsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2003
- Quantifying SMT decoupling capacitor placement in dc power-bus design for multilayer PCBsIEEE Transactions on Electromagnetic Compatibility, 2001
- Efficient clipping of arbitrary polygonsACM Transactions on Graphics, 1998
- Automatic PCB Inspection Algorithms: A SurveyComputer Vision and Image Understanding, 1996
- A generic solution to polygon clippingCommunications of the ACM, 1992
- On the Complexity of Sparse $QR$ and $LU$ Factorization of Finite-Element MatricesSIAM Journal on Scientific and Statistical Computing, 1988
- Simulated annealing1987
- Application of the finite element method to heat conduction analysisNuclear Engineering and Design, 1966