Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 217,973,386 papers from all fields of science
Search
Sign In
Create Free Account
International Symposium on Physical Design
Known as:
ISPD
The International Symposium on Physical Design, or ISPD is a yearly conference on the topic of electronic design automation, concentrating on…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Asia and South Pacific Design Automation Conference
Design Automation Conference
Design Automation and Test in Europe
Electronic design automation
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
High-Definition Routing Congestion Prediction for Large-Scale FPGAs
M. Alawieh
,
Wuxi Li
,
Yibo Lin
,
L. Singhal
,
M. Iyer
,
D. Pan
Asia and South Pacific Design Automation…
2020
Corpus ID: 214692445
To speed up the FPGA placement and routing closure, we propose a novel approach to predict the routing congestion map for large…
Expand
2017
2017
Clock-aware ultrascale FPGA placement with machine learning routability prediction: (Invited paper)
Chak-Wa Pui
,
Gengjie Chen
,
Yuzhe Ma
,
Evangeline F. Y. Young
,
Bei Yu
IEEE/ACM International Conference on Computer…
2017
Corpus ID: 4686287
As the complexity and scale of circuits keep growing, clocking architectures of FPGAs have become more complex to meet the timing…
Expand
Highly Cited
2015
Highly Cited
2015
The energy distribution of trapped charges in polymers based on isothermal surface potential decay model
Jianying Li
,
Fusheng Zhou
,
D. Min
,
Shengtao Li
,
Rong Xia
IEEE transactions on dielectrics and electrical…
2015
Corpus ID: 24009439
Space charge formation in polymeric materials can cause some serious concern in real operation, because it has significant…
Expand
Highly Cited
2015
Highly Cited
2015
ePlace: Electrostatics-Based Placement Using Fast Fourier Transform and Nesterov's Method
Jingwei Lu
,
Pengwen Chen
,
+4 authors
Chung-Kuan Cheng
TODE
2015
Corpus ID: 2465834
We develop a flat, analytic, and nonlinear placement algorithm, ePlace, which is more effective, generalized, simpler, and faster…
Expand
Review
2013
Review
2013
Proceedings of the 2013 ACM International symposium on Physical Design
Cheng-Kok Koh
,
C. Sze
ACM International Symposium on Physical Design
2013
Corpus ID: 28389067
On behalf of the organizing committee, we are delighted to welcome you to the 2013 ACM International Symposium on Physical Design…
Expand
Highly Cited
2013
Highly Cited
2013
NCTU-GR 2.0: Multithreaded Collision-Aware Global Routing With Bounded-Length Maze Routing
Wen-Hao Liu
,
Wei-Chun Kao
,
Yih-Lang Li
,
Kai-Yuan Chao
IEEE Transactions on Computer-Aided Design of…
2013
Corpus ID: 16609283
Modern global routers employ various routing methods to improve routing speed and quality. Maze routing is the most time…
Expand
2013
2013
Micro-sectioning approach for quality and reliability assessment of wire bonding interfaces in IGBT modules
Kristian Bonderup Pedersen
,
P. Kristensen
,
V. Popok
,
K. Pedersen
Microelectronics and reliability
2013
Corpus ID: 1129875
Highly Cited
2010
Highly Cited
2010
SimPL: An effective placement algorithm
Myung-Chul Kim
,
Dongjin Lee
,
I. Markov
IEEE/ACM International Conference on Computer…
2010
Corpus ID: 47293399
We propose a self-contained, flat, force-directed algorithm for global placement that is simpler than existing placers and easier…
Expand
Review
2009
Review
2009
Global routing revisited
Michael D. Moffitt
IEEE/ACM International Conference on Computer…
2009
Corpus ID: 14419059
Recent progress in the area of global routing has been remarkable; yet, in many ways, the classical formulation has yet to catch…
Expand
Review
1977
Review
1977
A Penetrating Gaze at One Open Phase: Analyzing the Polyphase Induction Motor Dilemma
M. S. Griffith
IEEE transactions on industry applications
1977
Corpus ID: 8449021
Portions of the material proposed for a chapter in a new IEEE Standard (#399-the ``Brown Book'') being prepared by the Power…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE