DocumentCode
1558058
Title
Buffer block planning for interconnect planning and prediction
Author
Cong, Jason ; Kong, Tianming ; Pan, Zhigang
Author_Institution
Dept. of Comput. Sci., California Univ., Los Angeles, CA, USA
Volume
9
Issue
6
fYear
2001
Firstpage
929
Lastpage
937
Abstract
This paper studies buffer block planning (BBP) for interconnect planning and prediction in deep submicron designs. We first introduce the concept of a feasible region for buffer insertion, and derive its closed-form formula. We observe that the feasible region for a buffer is quite large in general even under fairly tight delay constraint. Therefore, it gives a lot of flexibility to plan for buffer locations. We then develop an effective BBP algorithm to perform buffer clustering such that design objectives such as overall chip area and the number of buffer blocks can be minimized. Effective BBP can plan and predict system-level interconnect by construction, so that accurate interconnect information can be used in early design stages to ensure design closure.
Keywords
VLSI; buffer circuits; circuit layout CAD; circuit optimisation; delays; integrated circuit interconnections; integrated circuit layout; VLSI; buffer block planning; buffer insertion; circuit complexity; circuit performance; closed-form formula; deep submicron designs; delay constraint; design objectives; feasible region; floorplanning; interconnect planning; interconnect prediction; optimization techniques; overall chip area; system-level interconnect; Algorithm design and analysis; Circuit optimization; Circuit topology; Clustering algorithms; Delay estimation; Driver circuits; Integrated circuit interconnections; Timing; Very large scale integration; Wire;
fLanguage
English
Journal_Title
Very Large Scale Integration (VLSI) Systems, IEEE Transactions on
Publisher
ieee
ISSN
1063-8210
Type
jour
DOI
10.1109/92.974906
Filename
974906
Link To Document