Title :
Floorplanning with clock tree estimation
Author :
Lee, Chih-Hung ; Su, Chin-Hung ; Huang, Shih-Hsu ; Lin, Chih-Yuan ; Hsieh, Tsai-Ming
Author_Institution :
Dept. of Inf. Manage., Ling Tung Coll., Tai Chung, Taiwan
Abstract :
Traditional floorplanners determine the module topology for the minimization of total chip area, total wirelength, and routing congestion. However, as design complexity continues to increase, it is necessary to reduce the clock skew and estimate the clock latency during floorplanning. We propose a two-stage simulated annealing (SA) floorplanner based on sequence-pair representation. A clock tree estimation model is embedded into the floorplanner to guide the process of floorplan generation. Our clock tree model includes two parts. First, we use an H-tree algorithm to predict an intra-module clock tree for each module. Second, the DME algorithm is applied for inter-module clock tree generation. Experimental data show that both the clock tree wirelength and the clock latency can be improved simultaneously, while the extra overhead on the chip area is small.
Keywords :
integrated circuit layout; minimisation; network routing; network topology; parameter estimation; simulated annealing; trees (mathematics); H-tree algorithm; IC design; chip area minimization; clock latency estimation; clock skew; clock tree estimation; clock tree estimation model; inter-module clock tree generation; intra-module clock tree; module topology; routing congestion minimization; sequence-pair representation; simulated annealing floorplanner; wirelength minimization; Circuit topology; Clocks; Cost function; Delay; Educational institutions; Information management; Manufacturing; Routing; Signal synthesis; Simulated annealing; Clock Tree Planning; Floorplan-Based Clock Tree Model; Floorplanning; Zero Clock Skew;
Conference_Titel :
Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on
Print_ISBN :
0-7803-8834-8
DOI :
10.1109/ISCAS.2005.1466067