There are many different (and often confusing) terms associated
with clock-based devices. This application note attempts
to clarify these terms, and hence serves as a comprehensive
reference on clock terminology. This application note can be
divided into two sections. The first section describes and distinguishes
between various clock sources available today.
The second section defines and distinguishes between various
parameters used to describe clocks. This section also provides methods of measuring some of these parameters.
Jitter is extremely important in systems using PLL-based
clock drivers. The effects of jitter range from not having any
effect on system operation to rendering the system completely
non-functional. This application note provides the reader
with a clear understanding of jitter in high-speed systems. It
introduces the reader to various kinds of jitter in high-speed
systems, their causes and their effects, and methods of reducing
jitter. This application note will concentrate on jitter in PLL-based frequency synthesizers.
Cypress Semiconductor makes a variety of PLL-based clock
generators. This application note provides a set of recommendations
to optimize usage of Cypress clock devices in a
system. The application note begins with recommended termination
techniques for clock generators. Subsequently, power
supply filtering and bypassing is discussed. Finally, the application
note provides some recommendations on board
layout.
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may
fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is
not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then
the system reliability can be calculated in terms of such points. One computer example is shown to illustrate
the solution procedure.
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may
fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is
not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then
the system reliability can be calculated in terms of such points. One computer example is shown to illustrate
the solution procedure.
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may
fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is
not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then
the system reliability can be calculated in terms of such points. One computer example is shown to illustrate
the solution procedure.
This paper addresses a stochastic-#ow network in which each arc or node has several capacities and may
fail. Given the demand d, we try to evaluate the system reliability that the maximum #ow of the network is
not less than d. A simple algorithm is proposed "rstly to generate all lower boundary points for d, and then
the system reliability can be calculated in terms of such points. One computer example is shown to illustrate
the solution procedure.
