Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2013 (2013), Article ID 145936, 6 pages
http://dx.doi.org/10.1155/2013/145936
Research Article

Critical Delays in Clock Distribution Circuits

Escola Politécnica da Universidade de São Paulo, Avenida Professor Luciano Gualberto, Travessa 3, No. 158, 05508-900 São Paulo, SP, Brazil

Received 5 August 2013; Revised 28 September 2013; Accepted 13 October 2013

Academic Editor: Jui-Sheng Lin

Copyright © 2013 José R. C. Piqueira and Diego Paolo F. Correa. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

As the distribution of clock signals between the nodes of a network became a critical operational requisite, the transmission delays have to be studied because they affect the accurate recovering of the time basis. In this work, the critical delay value is calculated considering simplifications compatible with practical situations. The main contribution is to consider the dissipative terms in the node equations, expressing critical delays, depending on the time constant of the dissipation.

1. Introduction

The phase control problem in a network of oscillators is a problem that appears in several engineering situations: world wide time signal distribution, synchronous communication networks, distributed computation, processes control, and synchronous operation of micro- and nanocircuits. Generally speaking, the distribution of clock signals can be performed controlling the phase of a node oscillation by using the information of the phases of the other nodes that compose the whole network.

Modeling this kind of network presents two types of clock distribution strategies: master-slave (MS) and full-connected (FC), described by Lindsey et al., in a seminal paper that is an important reference for engineers working on design of networks [1].

Concerning the networks conceived up to the end of the last century, Synchronous Digital Hierarchy (SDH), employing MS strategies, was the most important solution becoming a standard recommended by ITU (International Telecommunication Union) [2]. The mathematical analysis of this solution has been widely studied with a lot of different approaches: linear differential equations [3], nonlinear differential equations [4], and stochastic differential equations [5].

Nowadays, it could be considered that clock signal distribution by using MS strategies is well studied and network designers have a lot of good references available for the several types of phase detection and signal filtering [6].

However, the network architecture evolved to complex topologies with phase and frequency references depending, at each node, on the phase and frequency of almost all the other nodes [7] and, consequently, to obtain general solutions becomes feasible only for certain particular situations [8] as the resulting equations for the isolated nodes are second-order, including a dissipative term. Besides, the coupling terms between the nodes are composed of nonlinear delayed terms [1].

Here, considering that operational frequencies of the node oscillators are normalized, the clock signal phase of each node is supposed to be described by [9] In (1), represents a dissipative time constant term, and represents a frequency node gain, both related to node . The effect of weak forces is represented by that considers noise and small perturbations. A wave propagation term appears as and it is responsible for considering the dependence of the local phase on the phase of all nodes and is given by In (2), represents the normalized connection matrix, that is, , for each node, and is the propagation delay between the nodes and .

The main goal of this paper is to study the several possible behaviors of a network, trying to express them to be related to the connection matrix, the nodes free-running frequencies, and the delays between the nodes. Considering the complexity of the problem, some simplifying assumptions are necessary in order to treat the problem.

The first simplification is about the network structure that is supposed to be triangular [8] as the practical networks are trees, composed of cells that can be modeled as triangles [1, 10]. They are supposed to have the same parameters. In spite of not being a general case, this assumption provides a simple reasoning with useful practical conclusions, as the circuit components are similar [10].

In the next section, the equations for this type of configuration will be derived with the spatial phase errors being the measurable state variables. Then, in order to analyze the tracking mode of the system, a linear model is developed, resulting in two decoupled equations relating the spatial errors to the delayed spatial errors.

Based on these equations, it is possible to calculate the critical delay that implies instability and to relate it to time constant of the dissipative terms. The calculation method for this critical value is presented, followed by numerical results and simulations confirming the conclusions.

2. Triangular PLL Network

Following the reasoning and notation exposed in the former section, a three-node PLL network can be modeled by the following equations:

At this point, it is assumed that the nodes have the same constitutive parameters, that is, and . These assumptions are reasonable considering a practical communication point of view, as the nodes are composed of standard blocks [6]. Besides, due to the same motive, it is considered that all nodes have the same accuracy and, consequently, the phases of the three nodes are used to adjust the phase of the local node with the same weight, resulting that [1].

In order to be more accurate from an engineering point of view, the delays between the nodes ought to be different. But in real modern networks, they assume low values, being fractions about of the period of the VCO oscillations, that is, of the node free-running period. Therefore, here all the delays are considered to be equal, that is, , and the results can be related to maximum permitted delays for real networks [2].

Taking the former conditions into consideration, the equations of the phase nodes become

To proceed with the analysis of the network, it must be considered that to obtain the node clocks in a correct sequence, the phase and frequency errors between the nodes have to vanish after any kind of perturbation, with as minimum overshoot and tracking time as possible. Consequently, the important state variables are the spatial phase () and frequency () errors, defined as

In this case, a three-node network, there are six index combinations defining the spatial errors () and (). However, if () and (), combined with () and (), are chosen, all the other spatial errors can be expressed as linear combinations of them. Therefore, combining (4), the system can be described by

3. Analysis of the Tracking Mode

An important indicator of the performance of a clock distribution systems is regarding its behavior in the tracking mode; that is, how the system recovers the synchronism when a perturbation around the synchronous state occurs [3].

In this case, the phase deviation can be considered to be small and the argument of the functions in (7) and (8) can replace the functions [1]. Therefore, the equations describing the system are

Consequently, the model for the tracking mode of a triangular PLL network is given by two decoupled equations, which are ordinary, homogeneous, and linear, containing a delay term. This equation admits an analytical solution. According to [11, 12], this type of delay differential equation corresponds to a transcendental characteristic equation, decomposable as which permits to calculate the critical stability value for the delay .

4. Critical Delay Value

The critical delay value for the three-node clock distribution network can be determined considering that the spatial errors are described by with parameter representing the time constant of the dissipative term and the bifurcation parameter representing the signal processing and propagation delay.

In order to determine how the bifurcation parameter determines the system stability it is necessary, for a given , to know the set such that, for a given , solutions for (12) change stability.

For the dynamical system described by (12), the characteristic equation is given by and can be written shortly as where .

It is supposed that there exists , called critical , that leads roots of the characteristic equation up to the imaginary axis, such that with (), implying the possible onset of a Hopf bifurcation [13].

Consequently, the module condition must hold. Therefore, considering only positive values of , from (15), it is possible to find

The number of values for depends on the degree of the polynomial . Considering only the positive and real ones, the roots have to also satisfy the angle condition for (14), given by for some .

Then, from (16) and (17), it is possible to find a relationship between a given and its associated critical :

By computing the module condition given by (15), for , there are four possible roots: and replacing (16) into (18) results in

Equation (20) shows that, for a given , there are infinite periodical critical values for , with period:

It can be noticed that there are some situations with (19) having no positive roots, meaning that, for some values of , there is no that leads the roots up to the imaginary axis. In this case, system stability will depend on the position of the roots for , for the given .

5. Numerical Results and Critical Delays

For a system given by (12), it is possible, by using (19), to calculate which values of allow critical time delays , responsible for bifurcations characterized by changing stability.

Figure 1 shows the real positive values of , given by (19). It can be seen that these roots suddenly appear for values of greater than . Analyzing characteristic equation (13), for , it can be seen that the system described by (12) is stable for every . Then, for , the system described by (12) remains stable for every value of time delay.

145936.fig.001
Figure 1: Real positive values for given in (19). These values appear for .

However, considering a practical point of view, it is important to know how the critical delay values () are related to the dissipative time constant (). Equations (19) and (20) show that, for a set of values of , there exist families of possible , depending on (whenever ), corresponding in (19) to two real positive roots, for each given , each one associated with a critical , as shown in Figure 2.

145936.fig.002
Figure 2: following (19) and (20). One curve for each .

6. Engineering Results

The results presented here enable the design of a clock distribution network with second-order dissipative nodes [1] considering delays between nodes as a complement of the designing technics derived in [7] for delay-free networks.

The general idea is to maintain the delays of the network smaller than the critical value derived here. Under this condition, the reachability of the synchronous state follows the criteria shown in [7].

As the equations considered here are for normalized angular frequency and the time constant represents the node filter, it must be equal to , in order to avoid double-frequency jitter [14, 15].

Consequently, taking and using (19) result in  rad/seg and  rad/seg. From (20), the corresponding critical delay values are and , for .

Simulations of (12) were performed by using DDE23 Matlab’s subroutine, with integration step and simulation time , for three different situations: Figure 3(a): , Figure 3(b): , and Figure 3(c): .

fig3
Figure 3: Simulations for (12) with parameter for three different values of . (a) ; initial condition: ; attractor: equilibrium point. (b) ; initial condition: ; attractor: limit-cycle. (c) ; initial condition: ; attractor: infinity.

Finally, it can be concluded that is a bifurcation parameter. Figure 4 shows a periodic solution, related to Figure 3(b). The angular frequency experimentally measured for is  rad/seg.

145936.fig.004
Figure 4: under Figure 3(b) conditions.

Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

References

  1. W. C. Lindsey, F. Ghazvinian, W. C. Hagmann, and K. Dessouky, “Network synchronization,” Proceedings of the IEEE, vol. 73, no. 10, pp. 1445–1467, 1985. View at Publisher · View at Google Scholar · View at Scopus
  2. Timing Requirements of Slave Clocks Suitable for Use as Node Clocks in Synchronization Networks—Recomendation G.812, ITU-T, 1997.
  3. H. Meyr and G. Ascheid, Synchronization in Digital Communications Phase-Frequency-Locked Loops, and Amplitude Control, vol. 1, John Wiley & Sons, New York, NY, USA, 1990.
  4. Á. M. Bueno, A. A. Ferreira, and J. R. C. Piqueira, “Modeling and filtering double-frequency jitter in one-way masterslave chain networks,” IEEE Transactions on Circuits and Systems I, vol. 57, no. 12, pp. 3104–3111, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. A. Mehrotra, “Noise analysis of phase-locked loops,” IEEE Transactions on Circuits and Systems I, vol. 49, no. 9, pp. 1309–1316, 2002. View at Publisher · View at Google Scholar · View at Scopus
  6. S. Bregni, Synchronization of Digital Telecommunications Networks, John Wiley & Sons, New York, NY, USA, 2002.
  7. F. M. Orsatti, R. Carareto, and J. R. C. Piqueira, “Mutually connected phase-locked loop networks: dynamical models and design parameters,” IET Circuits, Devices and Systems, vol. 2, no. 6, pp. 495–508, 2008. View at Publisher · View at Google Scholar · View at Scopus
  8. J. R. C. Piqueira, M. Q. Oliveira, and L. H. A. Monteiro, “Synchronous state in a fully connected phase-locked loop network,” Mathematical Problems in Engineering, vol. 2006, Article ID 52356, 12 pages, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. J. Stensby, “False lock and bifurcation in the phase locked loop,” SIAM Journal on Applied Mathematics, vol. 47, no. 6, pp. 1177–1184, 1987. View at Google Scholar · View at MathSciNet · View at Scopus
  10. R. D. Cideciyan and W. C. Lindsey, “Effects of long-term clock instability on master-slave networks,” IEEE Transactions on Communications, vol. 35, no. 9, pp. 950–955, 1987. View at Google Scholar · View at Scopus
  11. K. L. Cooke and Z. Grossman, “Discrete delay, distributed delay and stability switches,” Journal of Mathematical Analysis and Applications, vol. 86, no. 2, pp. 592–627, 1982. View at Google Scholar · View at MathSciNet · View at Scopus
  12. J. E. Forde, Delay differential equation models in mathematical biology [Ph.D. thesis], The University of Michigan, 2005, http://www.math.utah.edu/~forde/research/JFthesis.pdf.
  13. J. R. C. Piqueira and L. H. A. Monteiro, “All-pole phase-locked loops: calculating lock-in range by using Evan's root-locus,” International Journal of Control, vol. 79, no. 7, pp. 822–829, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. J. R. C. Piqueira and A. Z. Caligares, “Double-frequency jitter in chain master-slave clock distribution networks: comparing topologies,” Journal of Communications and Networks, vol. 8, no. 1, pp. 8–12, 2006. View at Google Scholar · View at Scopus
  15. J. R. C. Piqueira and L. H. A. Monteiro, “Considering second-harmonic terms in the operation of the phase detector for second-order phase-locked loop,” IEEE Transactions on Circuits and Systems I, vol. 50, no. 6, pp. 805–809, 2003. View at Publisher · View at Google Scholar · View at Scopus