By Topic

Simple yet effective algorithms for block and I/O buffer placement in flip-chip design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hao-Yueh Hsieh ; Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan ; Ting-Chi Wang

We study the problem of block and I/O buffer placement in flip-chip design. The goal of the problem is to minimize simultaneously the total path delay and the total skew of all input/output signals. We present two simple, yet effective, algorithms for the problem. Both algorithms place blocks to minimize the total path delay, and place I/O buffers to minimize the total skew. As compared to an existing method (Peng, C.-Y., 2003), the experimental results show that both algorithms are able to get better placement solutions with improvement rates of up to 65% and 77.5%, respectively, and run much faster.

Published in:

Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on

Date of Conference:

23-26 May 2005