Files in this item

FilesDescriptionFormat

application/pdf

application/pdfChen_Ying-Yu.pdf (2MB)
(no description provided)PDF

Description

Title:Clock tree synthesis under aggressive buffer insertion
Author(s):Chen, Ying-Yu
Advisor(s):Chen, Deming
Department / Program:Electrical & Computer Eng
Discipline:Electrical & Computer Engr
Degree Granting Institution:University of Illinois at Urbana-Champaign
Degree:M.S.
Genre:Thesis
Subject(s):Clock Tree
Buffer Insertion
Buffer Sizing
Maze Routing
Slew
Abstract:In this thesis, we propose a maze-routing-based clock tree routing algorithm integrated with buffer insertion, buffer sizing, and topology generation that is able to consider general buffer insertion locations. While previous work on buffered clock tree synthesis restricts potential buffer locations on merge nodes in the clock tree topology, our proposed algorithm has more freedom and thus achieves more robust slew control. Buffer insertion along routing paths had been mostly avoided previously due to the difficulty of maintaining a low skew under such aggressive buffer insertion. We developed an accurate timing analysis engine for delay and slew estimations and a balanced routing scheme for better skew reduction during clock tree synthesis. As a result, we can perform aggressive buffer insertion and maintain accurate delay information and low skew. Buffer sizing is also guided by its performance for slew control. Experiments show that our synthesis results not only honor the slew constraints but also maintain reasonable skew.
Issue Date:2012-09-18
URI:http://hdl.handle.net/2142/34230
Rights Information:Copyright 2012 Ying-Yu Chen
Date Available in IDEALS:2012-09-18
Date Deposited:2012-08


This item appears in the following Collection(s)

Item Statistics