Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.

Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.

Like this presentation? Why not share!

- Clock Skew 2 by rchovatiya 2033 views
- Implementing Useful Clock Skew Usin... by M Mei 4091 views
- Metastability by nallapati anindra 427 views
- Jack_Knutson_SNUG_2003_Slides_Clock... by Jack Knutson 157 views
- Rs(n,k)exploring n and k in reed so... by Cisco 126 views
- Contamination delay by Nima Afraz 3630 views

No Downloads

Total views

6,094

On SlideShare

0

From Embeds

0

Number of Embeds

31

Shares

0

Downloads

0

Comments

0

Likes

15

No embeds

No notes for slide

- 1. Clock Skew
- 2. Clock Skew <ul><li>Definitions: </li></ul><ul><li>The difference between arrival times of the clock at different devices is called clock skew. </li></ul><ul><li>Example of clock skew: </li></ul>
- 3. Clock Skew <ul><li>Buffering the clock: </li></ul><ul><li>In a large system, the single clock signal may not have adequate fanout to drive all of the devices, so it may be necessary to provide one or two copies of the clock signal. </li></ul>The buffering method of figure (a) produces excessive clock skew, since CLOCK1 and CLOCK2 are delayed through an extra buffer compared to CLOCK. A recommended method is shown in figure (b). All of the clock signals go through identical buffers, and thus have roughly equal delays.
- 4. Minimizing the clock skew <ul><li>Add Delay in Data Path: </li></ul>The amount of the inserted delay (number of BUFD or INVD macros) in the data path should be large enough so that the delay becomes sufficiently greater than the clock skew.
- 5. Minimizing the clock skew <ul><li>Clock Reversing: </li></ul>In this method, the clock signal arrives at the clock port of the destination register sooner than the source register. Therefore, the destination register will clock in the source register (current) value before the source register receives it’s clock edge. The clock reversing method will not be effective in circular structures such as Johnson counters because it is not possible to define the source register explicitly.
- 6. Minimizing the clock skew <ul><li>Clock Reversing in circular structure: </li></ul>In this example, the clock skew problem exists between flip-flops U1 and U3.
- 7. Minimizing the clock skew <ul><li>Alternate Phase Clocking: </li></ul><ul><li>The following are the most common methods of alternate phase clocking: </li></ul><ul><li>1. Clocking on alternate edges </li></ul><ul><li>2. Clocking with two phases </li></ul><ul><li>1. Clocking on alternate edges: </li></ul>In this method, the sequentially adjacent registers are clocked on opposite edges of the clock. This method provides a short path-clock skew margin of about one-half clock cycle.
- 8. Minimizing the clock skew <ul><li>Signal propagation for previous circuit: </li></ul>
- 9. Minimizing the clock skew <ul><li>Clocking with two phases: </li></ul>In this method, the sequentially adjacent registers are alternatively clocked on two different phases of the same clock. In this case, between each two adjacent registers, there is a safety margin approximately equal to the phase difference of the two phases.
- 10. <ul><li>THANK YOU </li></ul>

No public clipboards found for this slide

×
### Save the most important slides with Clipping

Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.

Be the first to comment