Please use this identifier to cite or link to this item:
http://10.1.7.192:80/jspui/handle/123456789/2390
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Gajjar, Viren R. | - |
dc.date.accessioned | 2011-07-04T09:49:05Z | - |
dc.date.available | 2011-07-04T09:49:05Z | - |
dc.date.issued | 2011-06-01 | - |
dc.identifier.uri | http://hdl.handle.net/123456789/2390 | - |
dc.description.abstract | All the Digital circuits run on clock signal that also makes those circuits synchronous by nature. In a synchronous digital system, clock signal is used to de ne a time reference for the movement of data within that system. The clock distribution network (or clock tree, when this network forms a tree) distributes the clock sig- nals from a common point to all the elements that need it. Since this function is vital to the operation of a synchronous system, much attention has been given to the characteristics of these clock signals and the electrical networks used in their distri- bution. Clock signals are often regarded as simple control signals. however, these signals have some very special characteristics and attributes. As clock signal is the only versatile signal thus routing this signal to all the block without skew is tough task. This signal should also have higher driving strength so that it can drive num- ber of modules. Therefore from the origin of clock, there should be a mechanism to increase driving strength with zero skew to reach the RCB (Regional Clock Bu er). Currently for Global clock distribution a structure called clock binary tree with input connected to input and output connected to output of other gates, are used to have minimum skew to complete clock binary tree. This thesis is a compilation of algorithm developed to design clock binary tree and experiments done on di erent tree structures, which are used or can be used in global clock distribution for clock binary tree design. | en_US |
dc.publisher | Institute of Technology | en_US |
dc.relation.ispartofseries | 09MEC018 | en_US |
dc.subject | EC 2009 | en_US |
dc.subject | Project Report 2009 | en_US |
dc.subject | EC Project Report | en_US |
dc.subject | Project Report | en_US |
dc.subject | 09MEC | en_US |
dc.subject | 09MEC018 | en_US |
dc.subject | VLSI | en_US |
dc.subject | VLSI 2009 | en_US |
dc.subject | EC (VLSI) | en_US |
dc.title | Mathematical Modeling of Clock Binary Tree | en_US |
dc.type | Dissertation | en_US |
Appears in Collections: | Dissertation, EC (VLSI) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
09MEC018.pdf | 09MEC018 | 1.07 MB | Adobe PDF | ![]() View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.